A note on the average depth of trees

DOI10.1007/BF02279819zbMath0476.05034OpenAlexW1593096882MaRDI QIDQ1160188

Luc P. Devroye

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02279819

zbMATH Keywords

binary treeaverage depthrandom treesuccessful search time

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Stochastic processes (60G99)

Related Items (10)

Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach ⋮ A note on the probabilistic analysis of patricia trees ⋮ An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms ⋮ Improved behaviour of tries by adaptive branching ⋮ Analysis of random LC tries ⋮ A probabilistic analysis of the height of tries and of the complexity of triesort ⋮ On the average depth of asymmetric LC-tries ⋮ Some results on tries with adaptive branching. ⋮ On search by address computation ⋮ Computing the shortest reset words of synchronizing automata

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the average depth of trees