An insertion technique for one-sided height-balanced trees

DOI10.1145/360303.360334MaRDI QIDQ4096431zbMATH OpenOpenAlexFDO

Authors Daniel S. Hirschberg

Publication date 1976

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(3)

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

This page was built for publication: An insertion technique for one-sided height-balanced trees

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