On the height of random m‐ary search trees

DOI10.1002/rsa.3240010206zbMath0739.05077OpenAlexW2119067845MaRDI QIDQ3977075

Luc P. Devroye

Publication date: 25 June 1992

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240010206

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)

Related Items

Note on the heights of random recursive trees and random m‐ary search trees, A note on the growth of random trees, Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study, Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model, Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey, On the expected height of fringe-blanced trees

Cites Work

• Branching processes in the analysis of the heights of trees
• More Combinatorial Properties of Certain Trees
• Unnamed Item
• Unnamed Item