82 views
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
edited | 82 views
0

Its $\left \lceil n / 2^(h +1) \right \rceil$

For proof check this

http://www.cs.sfu.ca/CourseCentral/307/petra/2009/SLN_2.pdf

1