摘要：
What is it?If a binary tree who's node's value in left child tree is all smaller than root and the node's value in right child tree is all greater than root , and it also holds for any subtree in this tree, then this is a binary search tree.If we perform an inorder tree walk of T , which 阅读全文
