On Leftist Simply Generated Trees
Rainer Kemp · Journal of automata, languages and combinatorics · 1999
We shall derive a functional equation for the bivariate (resp. univariate) generating function associated with the number of leftist trees having a specified number of leaves and nodes (resp. of leaves) appearing in an arbitrary family of simply generated trees. In the case that only the leaves are specified we shall present an asymptotical equivalent to the corresponding number of leftist trees. That general result is illustrated by com- puting explicit values for the exact and asymptotical number of leftist trees belonging to various families of simply generated trees.