1. 1. ADELSON-VELSKII G. M. and LANDIS E. M., An Algorithm for the Organization of Information, Dokl. Akad. Nauk S.S.S.R., Vol. 146, 1962, pp. 263-266 (Russian). English translation in Soviet Math. Dokl., Vol. 3, 1962, pp. 1259-1263.156719
2. 2. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.4135920326.68005
3. 3. BAYER R., Symmetric Binary B-trees Data Structure and Maintenance Algorithms, Acta Informatica, Vol. 1, 1972, pp. 290-306.3231920233.68009
4. 4. BLUM N. and MEHLHORM K., Mittlere Anzahl von Rebalancierungoperationen in Gewichtsbalancierten Bäumen, 4th GI Conference on Theoretical Computer Science, Aachen 1979, Lecture Notes in Computer Science, Vol. 67, pp. 67-78, Springer, Berlin, Heidelberg, New York.5680930399.05022
5. 5. KARLTON P. L., FULLER S. H., SCROGGS R. E. and KAEHLER E. B., Performance of Height-Balanced Trees, Com. A.C.M. 19, Vol. 1, 1976, pp. 23-28.0317.68044