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

DOI10.1145/359146.359149MaRDI QIDQ3048275zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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)

Cited in

(1)

• Optimal binary search trees

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

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