GATE CSE 2009 | Question: 59

Question

Consider a binary max-heap implemented using an array.
Which one of the following array represents a binary max-heap?

• A. $\left\{25,12,16,13,10,8,14\right\}$    
• B. $\left\{25,14,13,16,10,8,12\right\}$
• C. $\left\{25,14,16,13,10,8,12\right\}$
• D. $\left\{25,14,12,13,10,8,16\right\}$

Answer 1

Answer : (C)

The binary max-Heap looks like this :

Max-heap

 

Answer 2

Taking the given array as level order traversal, we can build binary tree.

(A)  13 comes as child of 12, which is not allowed in a binary max-heap

(B) 16 comes as child of 14 violating max-heap property

(C) is a valid binary max-heap as all children are smaller than their parent

(D) 16 comes as child of 12, violating max-heap property

Answer 3

option c is right