Analysis of some statistics for increasing tree families
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of increasing trees. Increasing trees are labelled rooted trees where labels along any branch from the root go in increasing order. Many mportant tree families that have applications in computer science...
Main Authors: | Alois Panholzer, Helmut Prodinger |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2004-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/326/pdf |
Similar Items
-
Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01) -
Descendants and ascendants in binary trees
by: Alois Panholzer, et al.
Published: (1997-01-01) -
Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01) -
The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-01-01) -
Right-cancellability of a family of operations on binary trees
by: Philippe Duchon
Published: (1998-01-01)