摘要: Given a binary search tree and a node in it, find the in-order successor of that node in the BST. The successor of a node p is the node with the small 阅读全文
posted @ 2020-03-20 12:00 CNoodle 阅读(260) 评论(0) 推荐(0)
摘要: Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. 阅读全文
posted @ 2020-03-20 04:33 CNoodle 阅读(194) 评论(0) 推荐(0)
摘要: Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree. Exampl 阅读全文
posted @ 2020-03-20 03:04 CNoodle 阅读(170) 评论(0) 推荐(0)
摘要: Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The produc 阅读全文
posted @ 2020-03-20 01:26 CNoodle 阅读(333) 评论(0) 推荐(0)