The average height of binary trees and other simple trees
- 1 October 1982
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 25 (2), 171-213
- https://doi.org/10.1016/0022-0000(82)90004-6
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Periodic oscillations of coefficients of power series that satisfy functional equationsAdvances in Mathematics, 1982
- On the Order of Random Channel NetworksSIAM Journal on Algebraic Discrete Methods, 1980
- The number of registers required for evaluating arithmetic expressionsTheoretical Computer Science, 1979
- The average number of registers needed to evaluate a binary tree optimallyActa Informatica, 1979
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978
- Asymptotic Methods in EnumerationSIAM Review, 1974
- On the height of treesJournal of the Australian Mathematical Society, 1967
- The Enumeration of Trees by Height and DiameterIBM Journal of Research and Development, 1960
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937