Binary Search Tree (BST) is a binary tree data structure with the following properties,
- The left sub-tree of a node has nodes with keys lesser than the node’s key
- The right sub-tree of a node has nodes with key greater than the node’s key
- Both the left sub-tree and the right sub-tree must be BSTs
