B. Chauvin, M. Drmota, and J. J. 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, Universal Limit Laws for Depths in Random Trees, SIAM Journal on Computing, vol.28, issue.2, pp.409-432, 1998.
DOI : 10.1137/S0097539795283954

L. Devroye, Applications of Stein's method in the analysis of random binary search trees Steins method and Applications, Institute for Mathematical Sciences Lecture Notes Series, vol.5, pp.247-297, 2005.

M. Drmota, A. Iksanov, M. Moehle, and U. Roesler, A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree, Random Structures and Algorithms, vol.29, issue.3, 2006.
DOI : 10.1002/rsa.20233

W. Feller, An Introduction to Probability Theory and Its Applications, 1971.

C. Holmgren, Random Records and Cuttings in Binary Search Trees, Combinatorics, Probability and Computing, vol.33, issue.03, 2007.
DOI : 10.1002/rsa.20233

A. Iksanov and M. Moehle, A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree, Electronic Communications in Probability, vol.12, issue.0, 2006.
DOI : 10.1214/ECP.v12-1253

S. Janson, Random Records and Cuttings in Complete Binary Trees, Mathematics and Computer Science III, Algorithms, Trees, Combinatorics and Probabilities, pp.241-253, 2004.
DOI : 10.1007/978-3-0348-7915-6_24

S. Janson, Random cutting and records in deterministic and random trees, Random Structures and Algorithms, vol.12, issue.2, pp.139-179, 2006.
DOI : 10.1002/rsa.20086

J. A. Fill and S. Janson, Quicksort asymptotics, Journal of Algorithms, vol.44, issue.1, pp.4-28, 2002.
DOI : 10.1016/S0196-6774(02)00216-X

O. Kallenberg, Foundations of Modern Probability, 2002.
DOI : 10.1007/978-1-4757-4015-8

H. Mahmoud, On the average internal path length of m-ary search trees, Acta Informatica, vol.16, issue.1, pp.111-117, 1986.
DOI : 10.1007/BF00268078

H. Mahmoud and B. , Analysis of the space of search trees under the random insertion algorithm, Journal of Algorithms, vol.10, issue.1, pp.52-75, 1989.
DOI : 10.1016/0196-6774(89)90023-0

A. Meir and J. W. Moon, Cutting down random trees, Journal of the Australian Mathematical Society, vol.38, issue.03, pp.313-324, 1970.
DOI : 10.1112/jlms/s1-33.4.471

R. Neininger and L. Rüschendorf, On the internal path length ofd-dimensional quad trees, Random Structures and Algorithms, vol.42, issue.1, pp.25-41, 1999.
DOI : 10.1002/(SICI)1098-2418(199908)15:1<25::AID-RSA2>3.0.CO;2-R

U. Roesler, On the analysis of stochastic divide and conquer algorithms Average-case analysis of algorithms, Algorithmica 29, pp.238-261, 1998.