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}
}
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

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Cutting down very simple trees

  • A. Panholzer
  • SUBMITTED
  • 2003
3 Excerpts

A Survey of Recursive Trees

  • H. Mahmoud, R. Smythe
  • Theoretical Probability and Mathematical…
  • 1995
2 Excerpts

Distances in plane-oriented recursive trees

  • H. Mahmoud
  • Journal of Computational and Applied Mathematics…
  • 1992
3 Excerpts

Limiting distributions for path lengths in recursive trees

  • H. Mahmoud
  • Probability in the Engineering and Informational…
  • 1991
1 Excerpt

On the maximum degree and height of a random recursive tree

  • J. Szymański
  • Random Graphs ’87 (M. Karoński and A. Ruciński…
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…