Data Structures | Heap | Question 5

Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap? (GATE CS 2009)
(A) 25,12,16,13,10,8,14
(B) 25,12,16,13,10,8,14
(C) 25,14,16,13,10,8,12
(D) 25,14,12,13,10,8,16


Answer: (C)

Explanation: A tree is max-heap if data at every node in the tree is greater than or equal to it’s children’ s data.

In array representation of heap tree, a node at index i has its left child at index 2i + 1 and right child at index 2i + 2.

           25
        /      \
      /          \
    14            16
   /  \           /  \
 /      \       /     \
13     10      8       12


Quiz of this Question



My Personal Notes arrow_drop_up