On the recursion depth of special tree traversal algorithms (Q579943)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4016206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the recursion depth of special tree traversal algorithms |
scientific article; zbMATH DE number 4016206 |
Statements
On the recursion depth of special tree traversal algorithms (English)
0 references
1987
0 references
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.
0 references
analysis of algorithms
0 references
tree traversal algorithms
0 references
recursive algorithms
0 references
0.91962934
0 references
0.90838826
0 references
0.90009713
0 references
0 references
0.87451744
0 references
0.87451744
0 references
