1. 1. ADEL'SON-VEL'SKII 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 (in Russian); English Translation in Soviet. Math., Vol. 3, pp. 1259-1262.156719
2. 2. BROWN M. R., A Partial Analysis of Random Height-Balanced Trees, S.I.A.M. J. Comput., Vol. 8, 1979, pp. 33-41.5229680402.05024
3. 3. FOSTER C. C., Information Storage and Retrieval Using AVL-Trees, ACM 20th National Conference, 1965, pp. 192-205.
4. 4. KARLTON P. L., FULLER S. H., SCROGGS R. E. and KAEHLER E. B., Performance of Height-Balanced Trees, Comm. ACM., Vol. 19, 1976, pp. 23-28.0317.68044
5. 5. KNUTH D. E., The Art of Computer Programming, Sorting and Searching, Vol. 3, Addison-Wesley, Reading, MA, 1973.3784560302.68010