binary search trees

 binary search trees is a tree with a maximum of two children for each parent and
The value of the node of the left sub-tree is less than the value of its parent node's key.
The value of the node of the right sub-tree is greater than or equal to the value of its parent node's key.
There must be no duplicate nodes.