往Binary Search Tree里面加东西，一定会找到一个合适的leaf加上去。 那么：就是说someNode.left or someNode.right是null时，就是insert node的地方。 找到那个someNode就按照正常的Binary Search Tree规律。 Given a binary search tree and a new tree node, insert ...

In this set of notes, we’ll talk about Binary Search Trees (BST ... let’s talk about trees in general by looking at an example: Here is some important terminology about trees based on this example: ...

True or false? A binary search tree is a rooted tree. True or false? A node in a binary tree may have three or more children. Given an interior node in the tree, the node’s left subtree contains only ...

把target remove时，把target的children nodes 重新排列组成新的BST: inorder traversal, build tree based on inorder traversal list. 方法2: 分析规律,先找到target和parent, 然后根据性质，把target remove时，移动children nodes, 保证还是BST。 Given a ...