Naive algorithm (OBST Optimal Binary Search Trees)
Jump to navigation
Jump to search
Time Complexity
$O({4}^n /n \sqrt{n})$
Space Complexity
$O({1})$ words
(Derived: Constant space to verify optimality. Constant space if you can enumerate the trees in-situ.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940