Minimal-Comparison 2,3-Trees

DOI10.1137/0207037MaRDI QIDQ4167593zbMATH OpenOpenAlexFDO

Authors Arnold L. Rosenberg, Lawrence V. Snyder

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)

Cited in

(6)

• Height balanced 2-3 trees
• On the construction of weighted time-optimal B-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
• Optimum multiway search trees

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

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