Minimal-Comparison $2,3$-Trees

DOI10.1137/0207037zbMath0386.68061OpenAlexW2079834183MaRDI QIDQ4167593

Lawrence V. Snyder, Arnold L. Rosenberg

Publication date: 1978

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0207037

Mathematics Subject Classification ID

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

Related Items (6)

Optimum multiway search trees ⋮ On the construction of weighted time-optimal B-trees ⋮ Height balanced 2-3 trees ⋮ A comparative study of 2-3 trees and AVL trees ⋮ Time- and Space-optimal height-balanced 2-3 brother trees ⋮ Query costs in HB(1) trees versus 2?3 trees

This page was built for publication: Minimal-Comparison $2,3$-Trees