The optimal binary search tree for Andersson's search algorithm
From MaRDI portal
Recommendations
- Optimal binary search trees
- Optimal binary search trees
- Optimal alphabetic trees for binary search
- An Approximation Algorithm for Binary Searching in Trees
- An approximation algorithm for binary searching in trees
- Optimal Search in Trees
- Binary search trees of almost optimal height
- Reflections on Optimal and Nearly Optimal Binary Search Trees
- DYNAMIC OPTIMAL BINARY SEARCH TREE
- scientific article; zbMATH DE number 5237331
Cites work
Cited in
(7)- Thresholds and optimal binary comparison search trees
- Optimal alphabetic trees for binary search
- scientific article; zbMATH DE number 2081096 (Why is no real title available?)
- Optimal binary search trees
- The optimal binary search tree for Andersson's search algorithm
- A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
- Operations research applications of dichotomous search
This page was built for publication: The optimal binary search tree for Andersson's search algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323348)