Translator Disclaimer
2005 Martingales and Profile of Binary Search Trees
B. Chauvin, T. Klein, J.-F. Marckert, A Rouault
Author Affiliations +
Electron. J. Probab. 10: 420-435 (2005). DOI: 10.1214/EJP.v10-257

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.

Citation

Download Citation

B. Chauvin. T. Klein. J.-F. Marckert. A Rouault. "Martingales and Profile of Binary Search Trees." Electron. J. Probab. 10 420 - 435, 2005. https://doi.org/10.1214/EJP.v10-257

Information

Accepted: 6 June 2005; Published: 2005
First available in Project Euclid: 1 June 2016

zbMATH: 1109.60059
MathSciNet: MR2147314
Digital Object Identifier: 10.1214/EJP.v10-257

JOURNAL ARTICLE
16 PAGES


SHARE
Vol.10 • 2005
Back to Top