On the combinatorics of leftist trees

Discrete Applied Mathematics

Volumn 109, Issue 3, 2001, Pages 253-278

  Nogueira, P ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

05C05; 05C30

Indexed keywords

EID: 0001666564     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00250-X     Document Type: Article

References (18)

1. Bender E.A. Asymptotic methods in enumeration. SIAM Rev. 16:1974;485-515.
2. C.A. Crane, Linear lists and priority queues as balanced binary trees, Technical Report STAN-CS-72-259, Stanford University, 1972.
3. M. Drmota, The asymptotic number of leftist trees, preprint, Technical University of Vienna, 1999.
4. Flajolet P., Odlyzko A. The average height of binary trees and other simple trees. J. Comput. System Sci. 25:1982;171-213.
5. Ford G.W., Uhlenbeck G.E. Combinatorial problems in the theory of graphs, III. Proc. Natl. Acad. Sci. U.S.A. 42:1956;529-535.
6. Harary F., Palmer E.M. Graphical Enumeration. 1973;Academic Press, New York.
7. Harary F., Robinson R.W., Schwenk A.J. Twenty-step algorithm for determining the asymptotic number of trees of various species. J. Austral. Math. Soc. 20 (Series A):1975;483-503.
8. Kemp R. A note on the number of leftist trees. Inform. Process. Lett. 25:1987;227-232.
9. Kemp R. Further results on leftist trees. Karoński M., Jaworski J., Ruciński A. Random Graphs '87. 1990;103-130 Wiley, New York.
10. Kemp R. The expected additive weight of trees. Acta Inform. 26:1989;711-740.
11. Kemp R. On leftist simply generated trees. J. Automat. Languages Combin. 4:1999;313-331.
12. Knuth D. The Art of Computer Programming, Vol. 1. 1973;Addison-Wesley, Reading, MA.
13. Knuth D. The Art of Computer Programming, Vol. 3. 1973;Addison-Wesley, Reading, MA.
14. Meir A., Moon J.W. On the altitude of nodes in random trees. Can. J. Math. 30:1978;997-1015.
15. Odlyzko A.M. Asymptotic enumeration methods. Graham R.L., Grötschel M., Lovász L. Handbook of Combinatorics. 1995;1063-1229 Elsevier, Amsterdam.
16. Otter R. The number of trees. Ann. Math. 49:1948;583-599.
17. Pólya G. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und Chemisch Verbindungen. Acta Math. 68:1937;145-254.
18. Pólya G., Read R.C. Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds. 1987;Springer, New York.