Register

BINARY MIN HEAP MADE EASY TEST

2,345 views
1 1 vote

Consider a binary min heap given below containing integer in [1, 15]. The maximum number of node movement on 5 successive removal of element are ________.

                                       

 

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Theory of Computatio...Next → · Made easy
← Previous in category · MADEEASYNext in category → · Karumanchi
Position:
Show:

Related questions

5 5 votes
0 0 answers
1.2k
1.2k views
vamp_vaibhav asked Dec 29, 2017
1,156 views
Min heap tree
Answer given : 1935360 but I m getting 3225600 please check..
11 11 votes
5 answers 5 answers
6.2k
6.2k views
Vikrant Singh asked Dec 28, 2014
6,224 views
What is the complexity of finding 50th smallest element in an already constructed binary min-heap?
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap?$\Theta(1)$$\Theta (\log n)$$\Theta (n)$$\Theta (n \log n)$
5 5 votes
2 2 answers
192
192 views
GO Classes asked Jul 21
192 views
GO Classes DPP | GATE CS, DA | Data Structure | DeleteMin from Min-Heap
A min-heap is stored using $1$-based indexing as:$[2, 13, 7, 17, 14, 22, 8, 21]$After one $\texttt{DeleteMin}$ operation, what is the final heap array?$[7, 13, 8, 17, 14,...
0 0 votes
1 1 answer
1.0k
1.0k views
saurav raghaw asked Dec 22, 2018
1,034 views
MIN HEAP
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not?(A) O(log n)(B) O(n)(C) O(n logn)(D) O(1)