When we map a min-heap with n elements to an array with n + 1 elements, we ignore array element 0, and place the root value at which array index?
A)2
B)n+1
C)n
D)1

Question

Quizplus · Accepted Answer

When mapping a min-heap with n elements to an array with n + 1 elements, the root value is placed at array index 1, not 2 or n+1. This is because the array is being treated as a binary tree where the root is at index 1 and the children of a node at index i are at indices 2i and 2i+1. Thus, ignoring array element 0, the root node of the min-heap should be placed at index 1 of the array.

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