in DS retagged by
444 views
3 votes
3 votes
Suppose that a binary min-heap stores six elements with priorities $10,20,30,40,50$, and $60$ in its array $\text{A}.$ What is the largest of these items that could be stored in $\text{A}[2]?$ (indexing starts from zero)
in DS retagged by
444 views

2 Comments

How the answer is 50?
0
0

$ \large{\colorbox{yellow}{Detailed video solution of this question with direct time stamp}}$

All India Mock Test 4 - Solutions Part 1

1
1

1 Answer

4 votes
4 votes

We cannot place $60,$ there won't be any suitable child of $60.$ Hence, the largest could be $50.$
 

 

edited by
Answer:

Related questions