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

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

B. Bollobás and O. Riordan, Mathematical results on scale-free random graphs, pp.1-34, 2003.
DOI : 10.1002/3527602755.ch1

P. Dankelmann, O. R. Oellermann, and H. C. Swart, The average Steiner distance of a graph, Journal of Graph Theory, vol.22, issue.1, pp.15-22, 1996.
DOI : 10.1002/(SICI)1097-0118(199605)22:1<15::AID-JGT3>3.0.CO;2-O

L. Devroye and R. Neininger, Distances and Finger Search in Random Binary Search Trees, SIAM Journal on Computing, vol.33, issue.3, pp.647-658, 2004.
DOI : 10.1137/S0097539703424521

. Ph, A. Flajolet, and . Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, pp.216-240, 1990.

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

R. Van-der-hofstad, G. Hooghiemstra, and P. Van-mieghem, On the covariance of the level sizes in random recursive trees, Random Structures and Algorithms, vol.51, issue.4, pp.519-539, 2002.
DOI : 10.1002/rsa.10030

H. Hwang, On Convergence Rates in the Central Limit Theorems for Combinatorial Structures, European Journal of Combinatorics, vol.19, issue.3, pp.329-343, 1998.
DOI : 10.1006/eujc.1997.0179

H. Mahmoud and R. Neininger, Distribution of Distances in Random Binary Search Trees, The Annals of Applied Probability, pp.253-276, 2002.

H. Mahmoud and R. Smythe, A Survey of Recursive Trees, Theoretical Probability and Mathematical Statistics, vol.51, pp.1-27, 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

K. Morris, A. Panholzer, and H. Prodinger, On some parameters in heap ordered trees, Combinatorics , Probability and Computing, accepted for publication, 2002.

A. Panholzer, The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees, Random Structures and Algorithms, vol.14, issue.2, pp.179-207, 2004.
DOI : 10.1002/rsa.20027

A. Panholzer and H. Prodinger, Spanning tree size in random binary search trees, The Annals of Applied Probability, vol.14, pp.718-733, 2004.

H. Prodinger, Multiple Quickselect ??? Hoare's Find algorithm for several elements, Information Processing Letters, vol.56, issue.3, pp.123-129, 1995.
DOI : 10.1016/0020-0190(95)00150-B