2.6. Binary Search Tree

The definition of binary search tree (BST) can be slightly different in different context. Sometimes, it requires parent strictly greater than any node in left subtree, and other times the parent node can be equal to the max node in the left subtree.


Figure 2.6.1 A Binary Search Tree