In an array-based implementation of a heap,the parent of the node in items[i] is always stored in ______.
A)items[i/2]
B)items[(i-1)/2]
C)items[i-2]
D)items[(i-2)/2]

Question

Quizplus · Accepted Answer

The parent of a node in a heap implemented using an array is always stored at index (i-1)/2. This is because the left child of a node at index i is at index 2i+1 and the right child is at index 2i+2. If we subtract 1 from the index i, to get the index of the parent, the formula becomes (i-1)/2. Therefore, option B is the correct choice.

In an Array-Based Implementation of a Heap,the Parent of the Node