论文信息 - Tight Bounds on the Path Length of Binary Trees - 字舞流文

Tight Bounds on the Path Length of Binary Trees

The external path length of a tree T is the sum of the lengths of the paths from the root to the external nodes. The maximal path length difference Δ is the difference of the lengths of the longest and shortest such path.

Alfredo De Santis | Giuseppe Persiano

[1] Derick Wood,et al. The Path Length of Binary Trees , 1989, FODO.

[2] Donald E. Knuth,et al. Sorting and Searching , 1973 .

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

[4] Derick Wood,et al. On the path length of binary trees , 1989, JACM.

[5] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[6] Chak-Kuen Wong,et al. Upper Bounds for the Total Path Length of Binary Trees , 1973, JACM.

[7] G. X. Ritter. Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28 - September 1, 1989 , 1989, IFIP Congress.

[8] W. Specht. Zur Theorie der elementaren Mittel , 1960 .