Séminaire Lotharingien de Combinatoire, B25l (1990), 44 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1991, 462/S-25, p. 19-62.]

Peter Kirschenhofer

Enumeration of Trees

Abstract. Enumeration of trees is a more and more rapidly growing area of enumerative Combinatorics, especially since a number of problems in Computer Science, e.g. in the average case analysis of data structures and algorithms, involve the task to enumerate trees of a specified kind.

It is the aim of this article to survey some of the most important methods and results in this area. Of course by no means we can give a complete overview. Neverthelesswe hope that the selection of problems and methods might be helpful.

This article contains explicit combinatorial enumeration formulae as well as asymptotic results: in fact it turns out that in many problems of practical interest the latter kind of results is either the only one that can be achieved or even the preferable one for the interpretation of final results.


The following version is available: