Question set IV Let the height of a tree be the number of nodes along the longest path from the root node to the leaf
nodes. Suppose we have 10 integers 35, 46, 30, 34,99, 42, 75, 28, 70, 80. Please answer the following
【題組】18. We create an AVL tree by considering the integers one by one, starting with the first one, 30. Which
of the following is true?
(A) The height of the resulting tree is 5;
(B) The root of the resulting tree is
75;
(C)The node for 46 has one child;
(D) The parent of 99 is the node for 75.