試題詳解

8. Starting with an empty binary search tree, what is the maximum level of the nodes in the tree after this series of insertions: 3. 9, 1, 2, 7, 6, 5, 4, 8, 0? Note: the level of the root is one. No balancing operation occurs at insertions.
(A)3 or less
(B)4
(C) 5
(D) 6
(E) 7 or more