An optimal insertion algorithm for one-sided height-balanced binary search trees

DOI10.1145/359146.359149zbMath0413.68064DBLPjournals/cacm/RaihaZ79OpenAlexW1992675042WikidataQ61450096 ScholiaQ61450096MaRDI QIDQ3048275

Stuart H. Zweben, Kari-Jouko Raeihae

Publication date: 1979

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

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

zbMATH Keywords

one-sided height-balanced binary search treesoptimal insertion algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Optimal binary search trees

This page was built for publication: An optimal insertion algorithm for one-sided height-balanced binary search trees