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

DOI10.1145/359511.359514zbMath0379.68030OpenAlexW2066956744MaRDI QIDQ4158475

Michael A. McDonald, Stuart H. Zweben

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

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

Related Items

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