Answer the following questions about treeB. a. What is the height of the tree? b. Which nodes are on level 3? c. Which levels have the maximum number of nodes that they could contain? d. What is the...

Answer the following questions about treeB. a. What is the height of the tree? b. Which nodes are on level 3? c. Which levels have the maximum number of nodes that they could contain? d. What is the maximum height of a binary search tree containing these nodes? Draw such a tree. e. What is the minimum height of a binary search tree containing these nodes? Draw such a tree. f. What is the order in which the nodes are visited by an ignorer traversal? g. What is the order in which the nodes are visited by a preorder traversal? h. What is the order in which the nodes are visited by a postorder traversal?

Extracted text: treeB 56 47 69 es up 22 49 59 11 29 62 23 30 61 64