On the recursion depth of special tree traversal algorithms (Q579943)

In Computer Science several recursive algorithms are used for traversing the nodes of a planted plane tree. The performance of some important parameters of these algorithms may be described in terms of various notions of height. In the present paper several results on the statistics of these parameters are obtained by bijective combinatorial arguments, generating function techniques and translation lemmas for the asymptotic behaviour of the Taylor coefficients of functions having special kinds of singularities.