D. J. Aldous, The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees, SIAM Journal on Discrete Mathematics, vol.3, issue.4, pp.450-465, 1990.
DOI : 10.1137/0403039

D. J. Aldous, The continuum random tree I. The Annals of Probability, pp.1-28, 1991.
DOI : 10.1214/aop/1176990534

N. Broutin and P. Flajolet, The distribution of the height in random binary unlabelled trees, 2008.

P. Chassaing and J. Marckert, Parking functions, empirical processes, and the width of rooted labeled trees, Electronic Journal of Combinatorics, vol.8, issue.19, p.pp, 2001.

P. Chassaing, J. Marckert, and M. Yor, The height and width of simple trees, Mathematics and computer science Trends Math, pp.17-30, 2000.
DOI : 10.1007/978-3-0348-8405-1_2

N. G. De-bruijn, Asymptotic Methods in Analysis. Dover, 1981. A reprint of the third North Holland edition, 1958.

N. G. De-bruijn, D. E. Knuth, and S. O. Rice, THE AVERAGE HEIGHT OF PLANTED PLANE TREES, Graph Theory and Computing, pp.15-22, 1972.
DOI : 10.1016/B978-1-4832-3187-7.50007-6

M. Drmota and B. Gittenberger, The shape of unlabeled rooted random trees, European Journal of Combinatorics, vol.31, issue.8, 2008.
DOI : 10.1016/j.ejc.2010.05.011

S. Finch, Mathematical Constants, 2003.
DOI : 10.1017/CBO9780511550447

P. Flajolet and A. M. Odlyzko, The average height of binary trees and other simple trees, Journal of Computer and System Sciences, vol.25, issue.2, pp.171-213, 1982.
DOI : 10.1016/0022-0000(82)90004-6
URL : https://hal.archives-ouvertes.fr/inria-00076505

P. Flajolet and R. Sedgewick, Analytic Combinatorics URL http: //algo.inria.fr/flajolet. Free electronic version of a book to be published, 2008.
DOI : 10.1017/cbo9780511801655
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.5210

P. Flajolet, Z. Gao, A. Odlyzko, and B. Richmond, The Distribution of Heights of Binary Trees and Other Simple Trees, Combinatorics, Probability and Computing, vol.30, issue.02, pp.145-156, 1993.
DOI : 10.1016/0377-0427(91)90197-R
URL : https://hal.archives-ouvertes.fr/inria-00076989

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. Flajolet, P. Grabner, P. Kirschenhofer, and H. Prodinger, On Ramanujan's Q-function, Journal of Computational and Applied Mathematics, vol.58, issue.1, pp.103-116, 1995.
DOI : 10.1016/0377-0427(93)E0258-N

B. Gittenberger, The profile of unlabeled trees, Discrete Mathematics & Theoretical Computer Science Proceedings, vol.AD, pp.125-138, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184024

F. Harary and E. M. Palmer, Graphical Enumeration, 1973.
DOI : 10.1007/bfb0066432

D. P. Kennedy, The Galton-Watson Process Conditioned on the Total Progeny, Journal of Applied Probability, vol.12, issue.4, pp.800-806, 1975.
DOI : 10.2307/3212730

D. P. Kennedy, The distribution of the maximum Brownian excursion, Journal of Applied Probability, vol.13, issue.02, pp.371-376, 1976.
DOI : 10.1007/BF00535106

V. F. Kolchin, Random Mappings. Optimization Software Inc, 1984.

J. F. Le and . Gall, Random trees and applications, Probability Surveys, pp.245-311, 2005.

J. Marckert and G. Miermont, A limit theorem for rescaled binary rooted non plane trees, 2008.

A. Meir and J. W. Moon, On the altitude of nodes in random trees, Journal canadien de math??matiques, vol.30, issue.5, pp.997-1015, 1978.
DOI : 10.4153/CJM-1978-085-0

R. Otter, The Number of Trees, The Annals of Mathematics, vol.49, issue.3, pp.583-599, 1948.
DOI : 10.2307/1969046

G. Pólya, Kombinatorische Anzahlbestimmungen f??r Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, vol.68, issue.0, pp.145-254, 1937.
DOI : 10.1007/BF02546665

A. Rényi and G. Szekeres, On the height of trees, Journal of the Australian Mathematical Society, vol.4, issue.04, pp.497-507, 1967.
DOI : 10.1007/BF02559539