When we map a min-heap with n elements to an array with n + 1 elements, the right child of the root is stored at which array index?
A)2
B)1
C)3
D)4

Question

Quizplus · Accepted Answer

A min-heap is a complete binary tree where the value of each node is less than or equal to its children. When we map a min-heap to an array, we can use the following formula to find the index of the left and right child of a node:
Left child index = 2*parent index
Right child index = 2*parent index + 1

Since the root has index 1 in the array, its right child is at index 3 (2*1 + 1 = 3). Therefore, the correct choice is C.

When We Map a Min-Heap with N Elements to an Array