summaryrefslogtreecommitdiff
path: root/src/03/08/README.md
blob: 163f487adc10731ca68e8c50ca1ebcf6c324e118 (plain)
1
Prove that a binary tree with `k` leaves has height at least `log k`.