Binary Search Tree $($Sections $6\mathrm{.}3,8\mathrm{.}3)$

Write the TREE$-$SUCCESSOR $(x)$ procedure for a binary tree that supports post$-$order walk where $x$ is the

root of the tree. Note that to traverse a binary search tree that supports post$-$order walk, a process recursively

visits the left subtree first, then the right subtree, and then the parent node. Show your solution in the form of

pseudo code by following the textbook conventions.