De Prisco (Approximate OBST Optimal Binary Search Trees)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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.ezproxy.canberra.edu.au/science/a...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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.ezproxy.canberra.edu.au/science/article/pii/002001909390212R

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=De_Prisco_(Approximate_OBST_Optimal_Binary_Search_Trees)&oldid=45306"