摘要：Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Note: Given target value is a floati 阅读全文

摘要：Find the kth smallest element in the tree: Log n to reach the smallest element Log n + k (amortized) Given a binary search tree, write a function kthS 阅读全文

摘要：带返回值的 recursion Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of 阅读全文

摘要：Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the n 阅读全文

摘要：带返回值的 recursion. time： O(N), N is the number of nodes in the bst, space is O(1) , no extra space is used Given a binary tree, determine if it is a val 阅读全文