The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
87 views
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
asked in Algorithms by Active (2.1k points)
edited by | 87 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

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
48,725 questions
52,831 answers
183,519 comments
68,657 users