Symmetric binary B-trees: Data structure and maintenance algorithms. (English) Zbl 0233.68009


68N01 General topics in the theory of software
05C05 Trees
68R10 Graph theory (including graph drawing) in computer science
Full Text: DOI


[1] Adelson-Velskii, G. M., Landis, E. M.: An information organization algorithm. DANSSSR 146, 263-266 (1962).
[2] Bayer, R., McCreight, E. M.: Organization and maintenance of large ordered indexes. Acta Informatica 1, 173-189 (1972). · Zbl 0226.68008 · doi:10.1007/BF00288683
[3] Bayer, R.: Binary B-trees for virtual memory. Proceedings of 1971 ACM SIGFIDET Workshop on Data Description, Access and Control, edited by E. F. Codd and A. L. Dean. pp. 219-235 (Nov. 11-12, 1971), San Diego.
[4] Foster, C. C.: Information storage and retrieval using AVL-trees. Proc. ACM 20th Nat’l. Conf., p. 192-205. 1965.
[5] Knott, G. D.: A balanced tree structure and retrieval algorithm. Proc. of Symposium on Information Storage and Retrieval, Univ. of Maryland, April 1-2, 1971, PP. 175-196.
[6] Knuth, D. E.: The art of computer programming, vol. 1. Addison-Wesley, 1969. · Zbl 0191.18001
[7] Nievergelt, J., Reingold, E. M.: Binary search trees of bounded balance. To appear, Proceedings of 4th ACM SIGACT Conference 1972. · Zbl 0354.68062
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.