#2 Given a Binary Search Tree and a node value X. Delete the node with the given value X from the BST. If no node with value x exists, then do not make any change.
#3Given a Binary Search Tree (with all values unique) and two node values. Find the Lowest Common Ancestors of the two nodes in the BST.
#4 Given a Binary Search Tree and a range. Find all the numbers in the BST that lie in the given range. Note: Element greater than or equal to root go to the right side.