On an optimality property of ternary trees

DOI10.1016/S0019-9958(79)90121-9zbMATH Open0412.68054OpenAlexW2061022270MaRDI QIDQ4199540FDOQ4199540

Authors:

Publication date: 1979

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(79)90121-9

zbMATH Keywords

optimal ternary search trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cited In (4)

• Optimal worst case trees
• 3 is more promising algorithmic parameter than 2
• Increasing returns and the efficient acquisition of information
• Improving worst-case behavior of heaps

This page was built for publication: On an optimality property of ternary trees

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