Almost sure asymptotics for the random binary search tree

Details Almost sure asymptotics for the random binary search tree Almost sure asymptotics for the random binary search tree

2010-02-22

arxiv.org/abs/1002.3896v1

Mathematics

Probability

12 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Almost sure asymptotics for the random binary search tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Almost sure asymptotics for the random binary search tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost sure asymptotics for the random binary search tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-372672