Symmetric binary B-Trees: Data structure and maintenance algorithms

  title={Symmetric binary B-Trees: Data structure and maintenance algorithms},
  author={Rudolf Bayer},
  journal={Acta Informatica},
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. 
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS