×

On level numbers of t-ary trees. (English) Zbl 0513.05026


MSC:

05C05 Trees
05A15 Exact enumeration problems, generating functions
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bromwich, T., An Introduction to the Theory of Infinite Series, (1931) · Zbl 0004.00705
[2] Dockeray, N. R. C., An extension of Van der Mond’s theorem and some applications, Math. Gazette, 17, 26, (1933) · Zbl 0006.10602
[3] Exploring binary trees and other simple trees21st Annual Symposium on the Foundations of Computer ScienceIEEEPiscataway, NJ1980207216
[4] Klarner, DavidA., Correspondences between plane trees and binary sequences, J. Combinatorial Theory, 9, 401, (1970) · Zbl 0205.54702
[5] Knuth, D. E., The Art of Computer Programming. Vol. 1: Fundamental Algorithms, (1973) · Zbl 0191.17903
[6] Pólya, G.; Szego˝, G., Problems and theorems in analysis. Vol. I: Series, integral calculus, theory of functions, (1972) · Zbl 0236.00003
[7] Ruskey, F.; Hu, T. C., Generating binary trees lexicographically, SIAM J. Comput., 6, 745, (1977) · Zbl 0366.68027 · doi:10.1137/0206055
[8] Ruskey, Frank, Generating {\it t}-ary trees lexicographically, SIAM J. Comput., 7, 424, (1978) · Zbl 0386.68062 · doi:10.1137/0207034
[9] Ruskey, Frank, On the average shape of binary trees, SIAM J. Algebraic Discrete Methods, 1, 43, (1980) · Zbl 0496.68044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.