Almost sure asymptotics for the random binary search tree
Probability
2010-02-23 v1
Abstract
We consider a (random permutation model) binary search tree with n nodes and give asymptotics on the loglog 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
Cite
@article{arxiv.1002.3896,
title = {Almost sure asymptotics for the random binary search tree},
author = {Matthew I. Roberts},
journal= {arXiv preprint arXiv:1002.3896},
year = {2010}
}
Comments
12 pages, 2 figures