Use the following tree, in its original from, for each part of this question:
(a). If the value 33 is inserted into the tree, which node would be its parent?
(b). If the value 72 is inserted into the tree, which node would be its parent?
(c). If the root node 50 is deleted, the erase algorithm selects which node as the replacement node?
(d). If the node 30 is deleted, the erase algorithm selects which node as the replacement node?
(e). Traverse the tree, and list the nodes, via a preorder scan.
(f). Traverse the tree, and list the nodes, via an inorder scan.
(g). Traverse the tree, and list the nodes, via an postorder scan
(h). Traverse the tree, and list the nodes, via an level-order scan