問題詳情

(2) If k is the maximum height of T where Tis a full binary tree with 101 vertices, then k is
(A) 1~20
(B)21~40
(C) 41~60
(D) 61~80
(E)≥81.

參考答案

答案:[無官方正解]
難度:適中0.5
統計:A(0),B(0),C(0),D(0),E(0)

內容推薦