16 Given the following tree, 22 47 35 50 56 52 69 78 (a) Is this tree a binary search tree? Is this tree a full binary tree? (b) What is the height of the tree? List the nodes in level 3 (assume the root is the level 0). (c) Show the order in which the nodes in the original tree are visited by an in-order traversal. (d) Based on the original tree, re-draw the tree after the nodes 22, 52 are deleted.