Consider the following binary tree
(a) Show the order the nodes will be visited in a:
(b) Identify all of the leaf nodes.
(c) Identify all of the interior nodes.
(d) List all of the nodes on level 4.
(e) List all of the nodes in the path to each of the following nodes:
i. 83
ii. 39
iii.4
iv. 9
(f) Consider node 52 and list the node's:
i. descendants
ii. ancestors
iii. siblings
(g) Identify the depth of each of the following nodes:
i. 78
ii. 41
iii. 60
iv. 19