Binary search tree

For a binary tree to be a binary search tree,
The node value of left-subtree must be less than
root node and the node value of root node must
be less than right-subtree.
Basic operations on BST
Search
Insertion
Deletion