Garsia–Wachs algorithm (Alphabetic Tree Problem Optimal Binary Search Trees)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$ words
(https://epubs-siam-org.ezproxy.canberra.edu.au/doi/epdf/10.1137/0206045, See implementation of MINTREE)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1977
Reference
https://epubs-siam-org.ezproxy.canberra.edu.au/doi/abs/10.1137/0206045