1. G. M. Adel’son-Vel’skii and E. M. Landis. An algorithm for the organisation of information. Dokl. Akad. Nauk SSSR
146 (1962), 263–266 (in Russian); English Translation in Soviet. Math.
3, 1259-1262.
2. R. Bayer: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica
1 (1972), 290–306.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein: Introduction to Algorithms, Second Edition, The MIT Press, Cambridge, Massachusetts, 2001.
4. E. M. McCreight: Priority search trees. SIAM Journal on Computing
14 (1985), 257–276.
5. L. J. Guibas and R. Sedgewick: A dichromatic framework for balanaced trees. In: Proceedings of the 19th Annual IEEE Synposium on Foundations of Computer Science, Ann Arbor, pp. 8–21, 1978.