(3) Suppose that instead of each node x keeping the attribute x.parent, pointing to x's parent, it keeps x.successor, pointing to x's successor. Give pseudocode for Search, Insert, and Delete on a binary search tree T using this representation. These procedures should operate in time O(h), where h is the height of the tree T, and should update successor fields as necessary. Consider only ordinary binary search trees, not red-black trees. (Hint: You may wish to implement a subroutine that returns the parent of a node.)