問題詳情
8. Consider a complete binary tree with exactly 10000 nodes, implemented with an array. Sup-pose that a node has its value stored at index 4999 in the array. What index is the valuestored at for this node's right child?
(A) 9998
(B) 9999；
(C)10000；
(D) The node has no rightchild.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增