Given a binary search tree with no parent pointers, write the function

Node $**$ successor$($Node ${?}^{**}x,$ Node $**$ root$)\{dots\}$

The function must return the successor of the node $x$ in the binary search tree rooted at Node $*$root$.$