Register

Is it possible to delete intermediate node/number in Heap?

• recategorized by
534 views

1 Answer

Best answer
1 votes
1 votes
Yes you will have to traverse the entire heap in worst case and then delete it, then replace that position with the last element and then call Build-heap procedure.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Avijit Shaw asked Dec 21, 2018
4,393 views
Deleting a random node from Heap
What is the time complexity of 'deleting any random node from a max or min heap'?
What is the time complexity of 'deleting any random node from a max or min heap'?
User Avatar
5 votes
5 votes
5 answers
2
Tushar Shinde asked Jan 19, 2016
14,134 views
Number of nodes in heap of height 'h'
The number of nodes of height $h$ in any $n$-element heap is ________. $h$ $2^{h}$ ceil $\left[\frac{n}{2^{h}}\right]$ ceil $\left[\frac{n}{2^{h+1}}\right]$ Answer is given as D, But I think it should be C. Because, even if you take height=1 then possible nodes are 3 and 2.
The number of nodes of height $h$ in any $n$-element heap is ________.$h$$2^{h}$ceil $\left[\frac{n}{2^{h}}\right]$ceil $\left[\frac{n}{2^{h+1}}\right]$Answer is given as...
User Avatar
1 votes
1 votes
1 answer
3
Monisha asked Oct 29, 2014
1,170 views
What will be the complexity to find the 7th smallest element in a heap?
User Avatar
Link Copied!