On the analysis of algorithms for trees

The analysis of many algorithms concerning trees requires the enumeration of families of nodes of a given height in a set of given trees. The aim of this article is to present a theorem that reduces such an enumeration, under certain conditions of regularity, to the simplest or most well known enumeration of a particular family of trees. Several examples of its application are given.