M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, American Journal of Physics, vol.34, issue.2, 1964.
DOI : 10.1119/1.1972842

D. Aldous and P. Shields, A diffusion limit for a class of randomly-growing binary trees. Probab. Theory Related Fields, pp.509-542, 1988.

A. D. Barbour, L. Holst, and S. Janson, Poisson Approximation, 1992.

F. T. Bruss and R. Grübel, On the multiplicity of the maximum in a discrete random sample, Ann. Appl. Probab, vol.13, pp.1252-1263, 2003.

B. Chauvin, M. Drmota, and J. Jabbour-hattab, The Profile of Binary Search Trees, The Annals of Applied Probability, vol.11, issue.4, pp.1042-1062, 2001.
DOI : 10.1214/aoap/1015345394

L. Devroye, Applications of the theory of records in the study of random trees, Acta Informatica, vol.11, issue.1-2, pp.123-130, 1988.
DOI : 10.1007/BF02915448

R. P. Dobrow and R. T. Smythe, Poisson approximations for functionals of random trees, Proceedings of the Seventh International Conference on Random Structures and Algorithms, pp.79-92, 1995.

M. Drmota and H. Hwang, Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees, SIAM Journal on Discrete Mathematics, vol.19, issue.1, 2004.
DOI : 10.1137/S0895480104440134

M. Fuchs, H. Hwang, and R. Neininger, Bimodality and phase transitions in the profile variance of random binary search trees, 2004.

R. Grübel and N. Stefanoski, Mixed Poisson approximation of node depth distributions in random binary search trees, The Annals of Applied Probability, vol.15, issue.1A, pp.279-297, 2005.
DOI : 10.1214/105051604000000611

S. Janson, T. ?uczak, and A. Rucinski, Random Graphs, 2000.
DOI : 10.1002/9781118032718

P. Kirschenhofer and H. Prodinger, The number of winners in a discrete geometrically distributed sample, The Annals of Applied Probability, vol.6, issue.2, pp.687-694, 1996.
DOI : 10.1214/aoap/1034968150

H. M. Mahmoud, Evolution of Random Search Trees, 1992.

R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, 1996.