It is shown that the number of leftist trees of size n in a simply generated family of trees is asymptotically given by \sim α cn n‐3/2 with certain constants α>0 and c >1 . Furthermore, it is proved that the number of leaves in leftist trees with n nodes satisfies a central limit theorem.
