Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O(n)$
(Derived: uses a worklist of size O(n))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1993
Reference
https://epubs.siam.org/doi/abs/10.1137/S0895480193256651?journalCode=sjdmec