Height balanced 2-3 trees

DOI10.1007/BF02253053MaRDI QIDQ1251902zbMATH OpenOpenAlexFDO

Authors Vijay K. Vaishnavi, Hans-Peter Kriegel, D. Wood

Publication date 1979

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02253053

zbMATH Keywords

Height-Balanced Tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3497359 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3518272 (Why is no real title available?)
• scientific article; zbMATH DE number 3635514 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A generalization of AVL trees
• An insertion technique for one-sided height-balanced trees
• An optimal method for deletion in one-sided height-balanced trees
• Binary Search Trees of Bounded Balance
• Deletion in one-sided height balanced search trees
• Minimal-Comparison $2,3$-Trees
• On the correspondence between AVL trees and brother trees
• Organization and maintenance of large ordered indexes
• Right brother trees
• Symmetric binary B-trees: Data structure and maintenance algorithms

Cited in

(1)

• Time- and Space-optimal height-balanced 2-3 brother trees

This page was built for publication: Height balanced 2-3 trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251902)