Stratified balanced search trees

  title={Stratified balanced search trees},
  author={Jan van Leeuwen and Mark H. Overmars},
  journal={Acta Informatica},
We develop a new perspective on trees, that enables us to distinguish and analyse many different subclasses of known classes of (height-)balanced search trees in a uniform manner. The approach shows that a great many different local constraints, including an arbitrary degree of density, can be enforced on everyday balanced search tree models, without losing the O(log n) bound on the time for insertions, deletions and finds. The theory extends known concepts from the study of B-trees.