Garsia–Wachs algorithm (Alphabetic Tree Problem Optimal Binary Search Trees)

From Algorithm Wiki

Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n \log n)$ == Space Complexity == $O(n)$ words (https://epubs-siam-org.ezproxy.canberra.edu.au/doi/epdf/10.1137/0206045, See implementation of MINTREE) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1977 == Reference == https://epubs-siam-org.ezproxy.canberra.edu.au/doi/abs/10.1137/0206045")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(https://epubs-siam-org.ezproxy.canberra.edu.au/doi/epdf/10.1137/0206045, See implementation of MINTREE)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1977

Reference

https://epubs-siam-org.ezproxy.canberra.edu.au/doi/abs/10.1137/0206045

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Garsia–Wachs_algorithm_(Alphabetic_Tree_Problem_Optimal_Binary_Search_Trees)&oldid=45299"