On Foster's information storage and retrieval using AVL trees
Kay Chen Tan · Communications of the ACM · 1972
Foster [2] has proposed a method of constructing an AVL tree with depth (height) h and the number of items N being fixed and with the weighted sum of the items a maximum. The purpose of this note is to show that this method does not work in general.