1. Find minimum and maximum value in binary search tree
2. Find or search node in a binary search tree
3. Delete or remove node from binary search tree
4. Check given binary tree is a binary search tree
5. Find ceil value of input data in binary search tree
6. Find floor value of input data in Binary search tree
7. Find least or lowest common ancestor (LCA) in binary search tree
8. Find K smallest element in binary search tree (BST)
9. Print binary search tree for given range K1 & K2
10. Find InOrder predecessor of a node in a binary search tree (BST)
11. Find InOrder successor of a node in binary search tree (BST)