Height balanced 2-3 trees

DOI10.1007/BF02253053zbMath0392.68055OpenAlexW168260063MaRDI QIDQ1251902

Hans-Peter Kriegel, Derick Wood, Vijay K. Vaishnavi

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)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the correspondence between AVL trees and brother trees
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• 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
• Minimal-Comparison $2,3$-Trees
• Deletion in one-sided height balanced search trees
• Right brother trees
• Binary Search Trees of Bounded Balance

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