Consider the following binary tree:

Determine the size, height, and width of the tree.

Show the order the nodes will be visited in a:

i. preorder traversal ii. inorder traversal iii. postorder traversal iv. breadth-first traversal

(c) Identify all of the interior nodes and leaf nodes

(d) List all of the nodes on level 4.

(e) List all of the nodes in the path from root to each of the following nodes:

i. 4 iv. 9

(f) Consider node 52 and list the nodes:

i. descendants ii. Ancestors iii. siblings

(g) Identify the depth of each of the following nodes:

i. 78 ii. 41 iii. 60 iv. 19

14 78 2 39 52 60 23 83 (41 4 19 17