問題詳情
47. Suppose there is a binary tree whose number of nodes is 2n, (n is a positive integer), howmany nodes does this binary tree contain at least？
(A)
(B)
(C)
(D)
參考答案
答案：A
難度：計算中-1
書單：沒有書單，新增
難度：計算中-1
書單：沒有書單，新增
47. Suppose there is a binary tree whose number of nodes is 2n, (n is a positive integer), howmany nodes does this binary tree contain at least？
(A)