In this lecture, using what we have explored so far, prove that every proper binary tree of height h has at most 2^h many leaves. Do note that this claim is true for all binary trees [which can be proven using strong mathematical induction], but we prove it specifically for proper binary trees. We proved a similar claim previously about the levels of any binary tree using induction.
Time Stamps:
0:00 Lecture begins
0:14 Statement of claim
0:56 Proof of claim
12:52 Closing
Note: At 1:02 I did not write the word "proper" when I should have [it's in the notes]. This should be included, but is presumed in this presentation.
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Tor Asbjørn
Eric R
Patreon Supporters (Supporter Access!):
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
2