The Gateway to Computer Science Excellence
0 votes
30 views
Show that there are at most $\lceil  n/2^{h+1}\rceil$ nodes of height $h$ in any $n-$element heap.
in Algorithms by | 30 views

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
52,315 questions
60,438 answers
201,783 comments
95,262 users