問題詳情
8. Starting with an empty binary search tree, what is the maximum level of the nodes in the tree after thisseries of insertions: 3. 9, 1, 2, 7, 6, 5, 4, 8, 0? Note: the level of the root is one. No balancing operationoccurs at insertions.
(A)3 or less
(B)4
(C) 5
(D) 6
(E) 7 or more
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增