Implement algorithm Successor(x, k). For k = 1 to 20, call Successor (x, k) where x is the root node of the tree from Part A. Output the value of the successor of k (may be null). (In Java Programming)

Successor of a key Definition: The successor of a node x is the node with the smallest key greater than x.Key TreeSuccessor(x) if (x.Right!= NULL) return TreeMin(x.Right) else p = x.Parent while (p != NULL and x == p.Right) x = p p = x.Parent return p