試題詳解

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 value stored at for this node's right child?
(A) 9998
(B) 9999；
(C)10000；
(D) The node has no right child.