BST is defined as follows: left subtree of a node contains only nodes with keys **less than** the node’s key. Right subtree contains only node with keys**greater than the key. Both the left and right subtrees must also be binary search trees.