retagged by
13,853 views
23 votes
23 votes

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

  1. $\left\{25,12,16,13,10,8,14\right\}$    
  2. $\left\{25,14,13,16,10,8,12\right\}$
  3. $\left\{25,14,16,13,10,8,12\right\}$
  4. $\left\{25,14,12,13,10,8,16\right\}$
retagged by

3 Answers

Best answer
15 votes
15 votes

Answer : (C)

The binary max-Heap looks like this :

Max-heap

 

edited by
18 votes
18 votes
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:

Related questions

24 votes
24 votes
3 answers
1
40 votes
40 votes
5 answers
2
Kathleen asked Sep 22, 2014
43,538 views
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$.$2$$3$$4$$5$
32 votes
32 votes
2 answers
3
Kathleen asked Sep 22, 2014
7,325 views
The keys $12, 18, 13, 2, 3, 23, 5$ and $15$ are inserted into an initially empty hash table of length $10$ using open addressing with hash function $h(k) = k \mod 10$ and...