A complete binary tree with N nodes may be stored in an array A of length N by storing the root at A[0],and then storing in successive array locations the nodes of the tree in increasing order of the level of nodes.If nodes in the same level are stored in left to right order,then the left child of the node stored at A[k] will be stored at
A) A[k/2]
B) A[2k]
C) A[2k+1]
D) A[2k+2]

Question

Quizplus · Accepted Answer

The left child of the node stored at A[k] will be stored at A[2k+1] because in a complete binary tree, the left child of a node at index k is always at index 2k+1.

A Complete Binary Tree with N Nodes May Be Stored