Highly Influenced

# Level of nodes in increasing trees revisited

@article{Panholzer2007LevelON, title={Level of nodes in increasing trees revisited}, author={Alois Panholzer and Helmut Prodinger}, journal={Random Struct. Algorithms}, year={2007}, volume={31}, pages={203-226} }

- Published 2007 in Random Struct. Algorithms
DOI:10.1002/rsa.20161

Abstract. Simply generated families of trees are described by the equation T (z) = φ(T (z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ {1, . . . , n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They… CONTINUE READING

Highly Cited

This paper has 39 citations. REVIEW CITATIONS