Open Access
November 2001 The Profile of Binary Search Trees
Brigitte Chauvin, Michael Drmota, Jean Jabbour-Hattab
Ann. Appl. Probab. 11(4): 1042-1062 (November 2001). DOI: 10.1214/aoap/1015345394

Abstract

We characterize the limiting behavior of the number of nodes in level k of binary search trees Tn in the central region 1.2logn2.8logn. Especially we show that the width V¯n (the maximal number of internal nodes at the same level) satisfies V¯n(n/4πlogn) as n a.s.

Citation

Download Citation

Brigitte Chauvin. Michael Drmota. Jean Jabbour-Hattab. "The Profile of Binary Search Trees." Ann. Appl. Probab. 11 (4) 1042 - 1062, November 2001. https://doi.org/10.1214/aoap/1015345394

Information

Published: November 2001
First available in Project Euclid: 5 March 2002

zbMATH: 1012.60038
MathSciNet: MR1878289
Digital Object Identifier: 10.1214/aoap/1015345394

Subjects:
Primary: 05C05 , 60F17 , 60Q25

Keywords: asymptotic series expansion , complex analysis , Martingales , Repartition of nodes for binary search trees

Rights: Copyright © 2001 Institute of Mathematical Statistics

Vol.11 • No. 4 • November 2001
Back to Top