# Almost sure asymptotics for the random binary search tree

Abstract : We consider a (random permutation model) binary search tree with $n$ nodes and give asymptotics on the $\log$ $\log$ scale for the height $H_n$ and saturation level $h_n$ of the tree as $n \to \infty$, both almost surely and in probability. We then consider the number $F_n$ of particles at level $H_n$ at time $n$, and show that $F_n$ is unbounded almost surely.
Keywords :
Document type :
Conference papers
Drmota, Michael and Gittenberger, Bernhard. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), pp.565-576, 2010, DMTCS Proceedings
Domain :

https://hal.inria.fr/hal-00459166
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 20, 2015 - 4:32:32 PM
Last modification on : Thursday, April 27, 2017 - 9:46:36 AM
Document(s) archivé(s) le : Wednesday, April 26, 2017 - 9:53:16 AM

### File

dmAM0139.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-00459166, version 1

### Citation

Matthew Roberts. Almost sure asymptotics for the random binary search tree. Drmota, Michael and Gittenberger, Bernhard. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), pp.565-576, 2010, DMTCS Proceedings. <hal-00459166>

Record views