论文信息 - A note on the expected distribution of degrees in random binary trees - 字舞流文

A note on the expected distribution of degrees in random binary trees

We derive the expected numbers of nodes with 0, 1, and 2 children in random binary trees by using only elementary methods and concepts.

Erkki Mäkinen | Jarmo Siltaneva | E. Mäkinen | Jarmo Siltaneva

[1] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[2] Hosam M. Mahmoud. The Expected Distribution of Degrees in Random Binary Search Trees , 1986, Comput. J..

[3] M. Reiss,et al. Endnote , 1999, International Community Organising.

[4] Erkki Mäkinen,et al. Generating Random Binary Trees - A Survey , 1999, Inf. Sci..

[5] Philippe Flajolet,et al. An introduction to the analysis of algorithms , 1995 .

[6] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[7] David Thomas,et al. The Art in Computer Programming , 2001 .