Acta Informatica

, Volume 1, Issue 4, pp 290–306

Symmetric binary B-Trees: Data structure and maintenance algorithms

Authors

  • Rudolf Bayer
    • Mathematisches Institut der Technischen Universität, München
Article

DOI: 10.1007/BF00289509

Cite this article as:
Bayer, R. Acta Informatica (1972) 1: 290. doi:10.1007/BF00289509

Summary

A class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of keys can be done in time proportional to log N where N is the cardinality of the data-set. Symmetric B-Trees are a modification of B-trees described previously by Bayer and McCreight. This class of trees properly contains the balanced trees.

Copyright information

© Springer-Verlag 1972