Deletion in one-sided height balanced search trees

DOI10.1080/00207167808803145zbMath0393.68067OpenAlexW2141933931MaRDI QIDQ4174777

Thomas Ottmann

Publication date: 1978

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167808803145

zbMATH Keywords

DeletionOne-Sided Height Balanced Search Trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Related Items

Stratified balanced search trees ⋮ Height balanced 2-3 trees ⋮ One-sided k-height-balanced trees

Cites Work

• Unnamed Item
• An insertion technique for one-sided height-balanced trees
• An optimal method for deletion in one-sided height-balanced trees
• Right brother trees