D. Aldous, The continuum random tree II: an overview Stochastic Analysis, Proc. Soc. Lecture Note Ser, vol.167, pp.23-70, 1990.

L. Devroye, Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms, Algorithms Combin, vol.16, pp.249-314, 1998.
DOI : 10.1007/978-3-662-12788-9_7

S. Janson, Ideals in a Forest, One-Way Infinite Binary Trees and the Contraction Method, Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities (Proc, pp.393-414, 2002.
DOI : 10.1007/978-3-0348-8211-8_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

D. P. Kennedy, The Galton-Watson process conditioned on the total progeny, Journal of Applied Probability, vol.13, issue.04, pp.800-806, 1975.
DOI : 10.2307/1426333

M. Luczak and &. P. Winkler, Building uniformly random subtrees, Random Structures and Algorithms, vol.II, issue.4, pp.420-443, 2004.
DOI : 10.1002/rsa.20011

R. Lyons, R. Pemantle, and &. Y. Peres, Conceptual Proofs of $L$ Log $L$ Criteria for Mean Behavior of Branching Processes, The Annals of Probability, vol.23, issue.3, pp.1125-1138, 1995.
DOI : 10.1214/aop/1176988176

A. Meir and &. J. 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