Yao (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^{2})$ == Space Complexity == $O(n^{2})$ words (https://doi-org.ezproxy.canberra.edu.au/10.1137/0603055) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1982 == Reference == https://doi-org.ezproxy.canberra.edu.au/10.1137/0603055")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ words

(https://doi-org.ezproxy.canberra.edu.au/10.1137/0603055)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1982

Reference

https://doi-org.ezproxy.canberra.edu.au/10.1137/0603055

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