Optimal search trees using two-way key comparisons

DOI10.1007/BF01178732zbMath0820.68040OpenAlexW2072157347MaRDI QIDQ1342505

David Spuler

Publication date: 11 January 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01178732

zbMATH Keywords

binary search treesbinary split trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (4)

Optimal search trees using two-way key comparisons ⋮ Classification via two-way comparisons (extended abstract) ⋮ On the cost of unsuccessful searches in search trees with two-way comparisons ⋮ On Huang and Wong's algorithm for generalized binary split trees

Cites Work

• Unnamed Item
• Generalized binary split trees
• Optimal search trees using two-way key comparisons
• Optimal binary split trees
• Optimum split trees
• Faster construction of optimal binary split trees
• Median split trees

This page was built for publication: Optimal search trees using two-way key comparisons