Balance in Random Trees

Azer Akhmedov, Warren Shreve

We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly $k$-balanced for any $k\ge 3$.