1,291 views
1 votes
1 votes

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.

Related questions

5 votes
5 votes
0 answers
1
vamp_vaibhav asked Dec 29, 2017
590 views
Answer given : 1935360 but I m getting 3225600 please check..
11 votes
11 votes
5 answers
2
Vikrant Singh asked Dec 28, 2014
3,706 views
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)$
0 votes
0 votes
1 answer
3
saurav raghaw asked Dec 22, 2018
692 views
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)
1 votes
1 votes
1 answer
4
gmrishikumar asked Dec 1, 2018
2,302 views
What is the time complexity to find the Kth largest element in a Min-Heap? Or equivalently, What is the time complexity to find Kth smallest element in Max-Heap?