The height of increasing trees

DOI10.1007/s00026-009-0009-xzbMath1229.05085MaRDI QIDQ5894495

Michael Drmota

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-009-0009-x

zbMATH Keywords

height; average case analysis; recursive trees

Mathematics Subject Classification ID

05C05: Trees

05A16: Asymptotic enumeration

Related Items

Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves, The height of record‐biased trees, The total path length of split trees, A bijection of plane increasing trees with relaxed binary trees of right height at most one, The height of Mallows trees, Broadcasting on random recursive trees, Random self-similar trees: a mathematical theory of Horton laws, Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The random multisection problem, travelling waves and the distribution of the height of \(m\)-ary search trees
• Branching processes in the analysis of the heights of trees
• An analytic approach to the height of binary search trees
• Width of a scale-free tree
• The height of a random binary search tree
• An analytic approach to the height of binary search trees II
• A note on the height of binary search trees
• Note on the heights of random recursive trees and random m‐ary search trees
• The Maximum Degree of the Barabási–Albert Random Tree
• On the Variance of the Height of Random Binary Search Trees
• Level of nodes in increasing trees revisited
• The height of increasing trees