Path: csiph.com!aioe.org!.POSTED!not-for-mail
From: Daniel Bastos <dbastos@toledo.com>
Newsgroups: comp.programming
Subject: on an n-element heap and its nodes of height h
Date: Mon, 18 Apr 2016 08:48:44 -0300
Organization: Aioe.org NNTP Server
Lines: 3
Message-ID: <86h9ez2l43.fsf@toledo.com>
NNTP-Posting-Host: 2qgpAfNKKNVFtQ8BuAGQfg.user.gioia.aioe.org
Mime-Version: 1.0
Content-Type: text/plain
X-Complaints-To: abuse@aioe.org
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (windows-nt)
Cancel-Lock: sha1:5H6rgMykt0jCUNJLpTpjmlINCMs=
X-Notice: Filtered by postfilter v. 0.8.2
Xref: csiph.com comp.programming:6499

I wonder if anyone can show me intuitively that an n-element heap can
have at most ceil(n/2^{h + 1}) nodes of height h.  I would appreciate
any idea that help me see this.  Thank you!