Hu–Tucker algorithm (Alphabetic Tree Problem 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 \log n)$ == Space Complexity == $O(n)$ words (https://epubs.siam.org/doi/10.1137/0121057) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1971 == Reference == https://epubs.siam.org/doi/10.1137/0121057")
(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/doi/10.1137/0121057)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1971

Reference

https://epubs.siam.org/doi/10.1137/0121057

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Hu–Tucker_algorithm_(Alphabetic_Tree_Problem_Optimal_Binary_Search_Trees)&oldid=45300"