An insertion technique for one-sided height-balanced trees

DOI10.1145/360303.360334zbMath0331.68024OpenAlexW1967441729MaRDI QIDQ4096431

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

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

Related Items

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