On the combinatorics of leftist trees
- 15 May 2001
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 109 (3) , 253-278
- https://doi.org/10.1016/s0166-218x(00)00250-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The expected additive weight of treesActa Informatica, 1989
- A note on the number of leftist treesInformation Processing Letters, 1987
- Twenty-step algorithm for determining the asymptotic number of trees of various species: corrigendaJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1986
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978
- Twenty-step algorithm for determining the asymptotic number of trees of various specesJournal of the Australian Mathematical Society, 1975
- Asymptotic Methods in EnumerationSIAM Review, 1974
- The Art of Computer Programming, Vol. 3: Sorting and SearchingMathematics of Computation, 1974
- The Number of TreesAnnals of Mathematics, 1948
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937