Deletion in one-sided height balanced search trees

DOI10.1080/00207167808803145MaRDI QIDQ4174777zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• An insertion technique for one-sided height-balanced trees
• An optimal method for deletion in one-sided height-balanced trees
• Right brother trees

Cited in

(3)

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

This page was built for publication: Deletion in one-sided height balanced search trees

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