A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the combinatorics of leftist trees
2001
Discrete Applied Mathematics
Let 'n be the number of leftist trees with n nodes. The corresponding (ordinary) generating function '(x) is shown to satisfy an explicit functional equation, from which a speciÿc recurrence for the 'n is obtained. Some basic analytic properties of '(x) are uncovered. Then the problem of determining average quantities (expected additive weights, in the notation of Kemp (Acta Inform. 26 (1989) 711-740)) related to the distribution of nodes is re-analysed. Finally, the average height of leftist
doi:10.1016/s0166-218x(00)00250-x
fatcat:zf4ykij4vjbfta42xr4pocayuq