Levcopoulos; Lingas; Sack (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 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")

(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 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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Levcopoulos;_Lingas;_Sack_(Approximate_OBST_Optimal_Binary_Search_Trees)&oldid=45305"