Balance in Random Trees
Combinatorics
2014-04-07 v1
Abstract
We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly -balanced for any .
Keywords
Cite
@article{arxiv.1404.1153,
title = {Balance in Random Trees},
author = {Azer Akhmedov and Warren Shreve},
journal= {arXiv preprint arXiv:1404.1153},
year = {2014}
}
Comments
3 Figures