De Prisco (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 probability distribution, and three phases that alter a single tree that eventually is the result)
Description
Approximate?
Approximate
Approximation Factor: Upper bound: $H + 1 - p_0 - p_n + p_{max}$
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1993
Reference
https://www.sciencedirect.com/science/article/pii/002001909390212R