1. ADEL'SON-VEL'SKII, G.M. and E.M. LANDIS, An algorithm for the organization of information, Dokl. Akad. Nauk
SSSR 146 (1962) 263–266 (in Russian); English translation in Soviet. Math. 3 (1962) 1259–1262.
2. AHO, A.V., J.E. HOPCROFT and J.D. ULLMANN, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
3. BAYER, P.J., Improved bounds on the cost of optimal and balanced binary search trees, Tech. Report, Dept. of Computer Science, Massachusets Institute of Technology, Cambridge, MA, 1975.
4. BAYER, R. and E.M. McCREIGHT, Organization and maintenance of large ordered indices, Acta Inform.
1 (1972) 173–189.
5. BENT, S.W., D.D. SLEATOR and R.E. TARJAN, Biased search trees, SIAM J. Comput.
14 (3) (1985) 545–568.