Kurt Mehlhorn. Best possible bounds for the weighted path length of optimum binary search trees. In H. Barkhage, editor, Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975. Volume 33 of Lecture Notes in Computer Science, pages 31-41, Springer, 1975.