Answer Happy

(e) 6 points Suppose we model each node of a binary tree as an object called Node with the following attributes: Node.left, Node.right, Node.key. Let z be a node object. The goal is to insert node z into the tree in such a way that node z is the right-most node in the tree. You must provide two different procedures that solve this problem. One procedure is recursive, and the other one is not. The recursive solution is called Recursive-Right-insert(1,7), and the non-recursive solution is simply called Right-insert(1,2). Both procedures take as input the new node z and a reference to the root T of the binary tree. You may assume that T is not empty. Your solutions must be in basic pseudo-code. You may use NIL or None to reference an object that is not defined.