CLRS Problem 2.2

|

Binary Tree Inductive Proofs

|

The subject of binary trees provides a lot of variation, mainly in the number of ways in which they can be classified. This, in turn, provides an array of inductive proofs that can be applied differently dependending on your input data. This post is intended to cover some of the variations of binary trees and neat proofs relating to their number of nodes ($N$), number of internal nodes ($I$), number of leaves ($L$), and height ($H$).

CLRS Problem 2.1

|

Combinatorics - Merging N Objects

|

CLRS Exercise 2.2-3

|