An optimal method for deletion in one-sided height-balanced trees

DOI10.1145/359511.359514zbMATH Open0379.68030OpenAlexW2066956744MaRDI QIDQ4158475FDOQ4158475

Authors: Stuart H. Zweben, Michael A. McDonald 

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359511.359514

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited In (4)

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

This page was built for publication: An optimal method for deletion in one-sided height-balanced trees

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