Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Mehlhorn, K. (1977). A best possible bound for the weighted path length of binary search trees. SIAM Journal on Computing, 6, 235-239.