Martingales and Profile of Binary Search Trees
Probability
2007-05-23 v1
Abstract
We are interested in the asymptotic analysis of the binary search tree (BST) under the random permutation model. Via an embedding in a continuous time model, we get new results, in particular the asymptotic behavior of the profile.
Cite
@article{arxiv.math/0410211,
title = {Martingales and Profile of Binary Search Trees},
author = {Brigitte Chauvin and Thierry Klein and Jean-Francois Marckert and Alain Rouault},
journal= {arXiv preprint arXiv:math/0410211},
year = {2007}
}