One-sided k-height-balanced trees

DOI10.1007/BF02265310zbMath0394.68047OpenAlexW164172514MaRDI QIDQ1252718

Derick Wood, Thomas Ottmann, Hans-Werner Six

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

Deletion AlgorithmsOne-Sided Height-Balanced Trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Related Items

On the correspondence between AVL trees and brother trees

Cites Work

• Unnamed Item
• A generalization of AVL trees
• On the Height of Height-Balanced Trees
• An insertion technique for one-sided height-balanced trees
• Insertions and deletions in one-sided height-balanced trees
• Rebalancing Height Balanced Trees
• An optimal method for deletion in one-sided height-balanced trees
• Deletion in one-sided height balanced search trees
• Right brother trees