Levcopoulos; Lingas; Sack (Approximate OBST Optimal Binary Search Trees)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O(n)$ words
(Derived: Uses an auxiliary list of initial size $4n$)
Description
Approximate?
Approximate
Approximation Factor: $1 + \epsilon$
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1989
Reference
https://www.sciencedirect.com/science/article/pii/0304397589901345