The Path Length of Binary Trees

More than twenty years ago Nievergelt and Wong obtained a number of new bounds on the path length of binary trees in both the weighted and unweighted cases.

[1]  Edward M. Reingold,et al.  Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..

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

[3]  Derick Wood,et al.  Drawing Trees Nicely with TeX , 1989, Electron. Publ..

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

[5]  Chak-Kuen Wong,et al.  On Binary Search Trees , 1971, IFIP Congress.

[6]  Chak-Kuen Wong,et al.  Bounds on the Weighted Path Length of Binary Trees , 1972, Inf. Process. Lett..

[7]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

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

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

[10]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[11]  Henk J. Olivié,et al.  A New Class of Balanced Search Trees: Half Balanced Binary Search Trees , 1982, RAIRO Theor. Informatics Appl..

[12]  Derick Wood,et al.  On the Maximum Path Length of AVL Trees , 1988, CAAP.