Acta Informatica

, Volume 1, Issue 4, pp 290-306

First online:

Symmetric binary B-Trees: Data structure and maintenance algorithms

  • Rudolf BayerAffiliated withMathematisches Institut der Technischen Universität, München

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.