BST

Binary Search Tree

Serial No.	Questions
1	Find a value in a BST
2	Deletion of a node in a BST
3	Find min and max value in a BST
4	Find inorder successor and inorder predecessor in a BST
5	Check if a tree is a BST or not
6	Populate Inorder successor of all nodes
7	Find LCA of 2 nodes in a BST
8	Construct BST from preorder traversal
9	Convert Binary tree into BST
10	Convert a normal BST into a Balanced BST
11	Merge two BST [ V.V.V>IMP ]
12	Find Kth largest element in a BST
13	Find Kth smallest element in a BST
14	Count pairs from 2 BST whose sum is equal to given value "X"
15	Find the median of BST in O(n) time and O(1) space
16	Count BST ndoes that lie in a given range
17	Replace every element with the least greater element on its right
18	Given "n" appointments, find the conflicting appointments
19	Check preorder is valid or not
20	Check whether BST contains Dead end
21	Largest BST in a Binary Tree [ V.V.V.V.V IMP ]
22	Flatten BST to sorted list