M. Barlow, R. Pemantle-and-e, and . Perkins, Diffusion-limited aggregation on a tree, Probability Theory and Related Fields, vol.107, issue.1, pp.1-60, 1997.
DOI : 10.1007/s004400050076

F. Bergeron, P. Flajolet-and-b, and . Salvy, Varieties of increasing trees, Lecture Notes in Computer Science, vol.581, pp.24-48, 1992.
DOI : 10.1007/3-540-55251-0_2
URL : https://hal.archives-ouvertes.fr/inria-00074977

L. Devroye-and-b and . Reed, On the Variance of the Height of Random Binary Search Trees, SIAM Journal on Computing, vol.24, issue.6, pp.1157-1162, 1995.
DOI : 10.1137/S0097539792237541

M. Drmota, A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions, European Journal of Combinatorics, vol.15, issue.2, pp.139-152, 1994.
DOI : 10.1006/eujc.1994.1016

M. Drmota, The Variance of the height of binary search trees, Theoretical Computer Science, vol.270, issue.1-2, pp.913-919, 2002.
DOI : 10.1016/S0304-3975(01)00006-8

B. Reed, The height of a random binary search tree, Journal of the ACM, vol.50, issue.3
DOI : 10.1145/765568.765571

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

H. Prodinger, A q -Analogue of the Path Length of Binary Search Trees, Algorithmica, vol.31, issue.3, pp.433-441, 2001.
DOI : 10.1007/s00453-001-0058-y