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