The optimal binary search tree for Andersson's search algorithm

DOI10.1007/BF01210592zbMath0790.68029MaRDI QIDQ1323348

David Spuler

Publication date: 4 July 1994

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

zbMATH Keywords

search algorithmbinary search trees

Mathematics Subject Classification ID

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

Related Items (3)

Operations research applications of dichotomous search ⋮ Optimal binary search trees ⋮ The optimal binary search tree for Andersson's search algorithm

Cites Work

• The optimal binary search tree for Andersson's search algorithm
• Optimum binary search trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Unnamed Item

This page was built for publication: The optimal binary search tree for Andersson's search algorithm