Balanced ordered trees

A 0-balanced ordered three is an ordered tree all of whose root-to-leaf paths have the same length. In this article, we persent exact and asymptotic enumeration and distribution ersults for classes of 0-balanced ordered trees with n nodes. These results enable us to compute various expected values of interesting parameters defined on these trees. © 1994 John Wiley & Sons, Inc.