Proof – Some formulas

• a binary tree with n! leaves has a least height log(n!):