BST Review
The properties of the binary search tree All elements in the left subtree is less that the root node. All elements in the right subtree is greater than the root node. All the elements in the tree is unique. BST Search To search one node just compare it with the cur root node, if it less than the root node then go left subtree and otherwise to find it through the right subtree....