, Volume 1, Issue 4, pp 290-306

Symmetric binary B-Trees: Data structure and maintenance algorithms

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.

This work was partially supported by an NSF grant while the author was at Purdue University, Lafayette, Indiana, USA.