Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees)

From Algorithm Wiki

Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (Derived: uses a worklist of size O(n)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference == https://epubs.siam.org/doi/abs/10.1137/S0895480193256651?journalCode=sjdmec")

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

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$

(Derived: uses a worklist of size O(n))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1993

Reference

https://epubs.siam.org/doi/abs/10.1137/S0895480193256651?journalCode=sjdmec

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Klawe;_Mumey_(Alphabetic_Tree_Problem_Optimal_Binary_Search_Trees)&oldid=44352"