5.) Suppose that instead of each node x keeping the attribute x:p, pointing to xs

parent, it keeps x:succ, pointing to xs 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 . (Hint:

You may wish to implement a subroutine that returns the parent of a node. This is the same question of 12.3-5 in the textbook.)