Register

HEAP and its properties

• edited by
276 views
2 votes
2 votes
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
syedasafoora asked Nov 8, 2023
247 views
Consider the following algorithm for Build-Max-heap and the given array A=[ 47, 96, 35, 54, 77, 65, 83]. Run this algorithm on the given array and redraw the heap and the heap- array whenever the swapping takes place. dry run this statement
Consider the following algorithm for Build-Max-heap and the given array A=[ 47,96, 35, 54, 77, 65, 83]. Run this algorithm on the given array and redraw the heap and the ...
User Avatar
2 votes
2 votes
0 answers
2
Markzuck asked Jan 13, 2019
1,237 views
Madeeasy Max Heap 2019
Please explain the logic behind this shortcut and when to be used?
Please explain the logic behind this shortcut and when to be used?
User Avatar
0 votes
0 votes
0 answers
3
bts1jimin asked Sep 10, 2018
1,876 views
No. of comparison in min heap
What is the number of comparisons required to extract 45th element of the min heap?
What is the number of comparisons required to extract 45th element of the min heap?
User Avatar
0 votes
0 votes
0 answers
4
LavTheRawkstar asked Sep 9, 2018
1,459 views
# Binomial tree # Binomial Heap
What is Binomial tree please explain in easy words. Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20. Also apply the operation of extracting the minimum key in the resulting binomial Heap.
What is Binomial tree please explain in easy words.Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20.Also apply the operation o...
User Avatar
Link Copied!