P. Kirschenhofer, On the height of leaves in binary trees, J. Combinatorics, Information and System Sciences, vol.8, pp.44-60, 1983.

D. E. Knuth, The Art of Computer Programming. Volume 1: Fundamental Algorithms, 1968.

R. Sedgewick, Algorithms, 1991.
URL : https://hal.archives-ouvertes.fr/inria-00074300

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

C. Martínez and H. Prodinger, On the number of descendants and ascendants in random search trees, 1996.

P. Kirschenhofer, Some new results on the average height of binary trees, Ars Combinatoria, vol.16, pp.255-260, 1983.

R. Kemp, On the average oscillation of a stack, Combinatorica, vol.23, issue.2, pp.157-176, 1982.
DOI : 10.1007/BF02579315

P. Kirschenhofer and H. Prodinger, On the average hyperoscillations of planted plane trees, Combinatorica, vol.1, issue.2, pp.177-186, 1982.
DOI : 10.1007/BF02579316

P. Kirschenhofer and H. Prodinger, On the average oscillation of the contour of monotonically labelled ordered trees, Proc. 2nd World Conference on Mathematics at the Service of Man, pp.394-399, 1982.

W. Gutjahr and G. Pflug, The asymptotic contour process of a binary tree is a Brownian excursion, Stochastic Processes and their Applications, pp.69-89, 1992.
DOI : 10.1016/0304-4149(92)90147-I

W. Feller, An Introduction to Probability Theory and its Applications (Third Edition).V ol.1, 1968.