問題詳情

Question set IV Let the height of a tree be the number of nodes along the longest path from the root node to the leafnodes. Suppose we have 10 integers 35, 46, 30, 34,99, 42, 75, 28, 70, 80. Please answer the following
【題組】16. We create binary trees for these integers. What is the minimum height of all the possible trees?
(A)1；
(B) 2；
(C)3；
(D) 4.

參考答案

答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增