C. Christophi and H. Mahmoud, On Climbing tries (manuscript), 2007.

M. Drmota, Y. Reznik, S. Savari, W. Szpankowski, and W. , Analysis of variable-tofixed length codes, 2007.

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995.
DOI : 10.1016/0304-3975(95)00002-E
URL : https://hal.archives-ouvertes.fr/inria-00074307

P. Jacquet and W. Szpankowski, Analytical depoissonization and its applications, Theoretical Computer Science, vol.201, issue.1-2, pp.1-62, 1998.
DOI : 10.1016/S0304-3975(97)00167-9

D. Knuth, The Art of Computer Programming Sorting and Searching, 1998.

M. Kuba and A. Panholzer, The left-right-imbalance of binary search trees (manuscript), 2007.

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

H. Mahmoud, Sorting: A Distribution Theory, 2000.
DOI : 10.1002/9781118032886

H. Mahmoud, Imbalance in Random Digital Trees, Methodology and Computing in Applied Probability, vol.3, issue.2, 2007.
DOI : 10.1007/s11009-008-9087-1

A. Meir and J. Moon, Climbing certain types of rooted trees. II, Proceedings of the Fifth British Combinatorial Conference, pp.461-469, 1975.
DOI : 10.1007/BF01896073

A. Meir and J. Moon, Climbing certain types of rooted trees. II, Acta Mathematica Academiae Scientiarum Hungaricae, vol.68, issue.1-2, pp.43-54, 1978.
DOI : 10.1007/BF01896073

J. Moon, Climbing random trees, Aequationes Mathematicae, vol.4, issue.1, pp.68-74, 1970.
DOI : 10.1007/BF01819273

A. Panholzer, The climbing depth of random trees. Random Structures and Algorithms, pp.84-109, 2005.

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770