Binary Search Tree

A binary search tree has some basic properties:

• Each node has two children.
• The right child and all descendants have a greater value than the parent.
• The left child and all descendants have a smaller value than the parent.
• All children are binary search trees.

Click HERE if you want to learn more about this topic.