47. Suppose there is a binary tree whose number of nodes is 2n , (n is a positive integer), how many nodes does this binary tree contain at least?
(A) 
(B)
(C)
(D)
答案:登入後查看
統計: A(17), B(4), C(3), D(3), E(0) #2927209
統計: A(17), B(4), C(3), D(3), E(0) #2927209
詳解 (共 2 筆)
#7363136
阿節點數2n個,此二元樹不就2n個?
題目應該是說已知一棵二元樹有 $2^n$ 個葉節點,則此樹至少有多少個節點?
應該這樣才對吧
題目應該是說已知一棵二元樹有 $2^n$ 個葉節點,則此樹至少有多少個節點?
應該這樣才對吧
0
0