. Write C or C++ code that returns the successor of a node in a binary search tree (the BST stores integer keys). A successor of a node n is defined as the smallest key x in the BST such that x is bigger than the value of n, or null if that does not exist. You may assume that the BST does not contain duplicate keys. The implementation class may contain the following functions:

class TreeNode {

int getValue();

TreeNode getLeft();

TreeNode getRight();

TreeNode getParent(); }

int findSuccessor(TreeNode x) {

......;