Template:Binary search tree important properites

Here are some important properties of a binary search tree:
 * 1) There may NOT be duplicate keys in a binary search tree.
 * 2) For every node, the keys of all nodes in this node's left sub-tree are strictly less than the key of this node.
 * 3) For every node, the keys of all nodes in this node's right sub-tree are strictly greater than the key of this node.

Redirects

 * Template:BST properties