Properties :-

1. Left Subtree Nodes < Root
2. Right Subtree Nodes > Root
3. Left & Right Subtrees are also BST with no duplicates

Inorder Traversal of BST gives a sorted Sequence.

Most problems will be solved using recursion i.e. by dividing into subproblems & making recursive calls on Subtree.

1. Build BST

2. Search in a Binary Search Tree

3.  Delete Node in a BST

4. Root to Leaf Path

5. Validate Binary Search Tree

6. Invert Binary Tree

7. Convert Sorted Array to Binary Search Tree

8. Balance a Binary Search Tree