F. Bergeron, P. Flajolet, and B. 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

M. Kuba, Analysis of node isolation procedures and label-based parameters in tree structures, 2006.

M. Kuba and A. Panholzer, On the degree distribution of the nodes in increasing trees. manuscript, 2006.

M. Kuba and A. Panholzer, Descendants in increasing trees, Electronic Journal of Combinatorics, vol.13, issue.1, p.8, 2006.

M. Mahmoud and R. Smythe, A survey of recursive trees, Theoretical Probability and Mathematical Statistics, vol.51, pp.1-37, 1995.

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

A. Panholzer and H. Prodinger, the level of nodes in increasing trees revisited. Random Structures and Algorithms, 2005.

C. Su, Q. Feng, and Z. Hu, Uniform recursive trees: Branching structure and simple random downward walk, Journal of Mathematical Analysis and Applications, vol.315, issue.1, pp.225-243, 2006.
DOI : 10.1016/j.jmaa.2005.05.004

J. Vitter and P. Flajolet, Average-Case Analysis of Algorithms and Data Structures, Handbook of Theoretical Computer Science, pp.431-524, 1990.
DOI : 10.1016/B978-0-444-88071-0.50014-X
URL : https://hal.archives-ouvertes.fr/inria-00075834