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

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1511:15, 15 February 2023‎ Admin talk contribs‎ 371 bytes +371‎ Created page with "== Time Complexity == $O(n \log n)$ == Space Complexity == $O(n)$ words (https://epubs.siam.org/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/doi/abs/10.1137/0206045"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Garsia–Wachs_algorithm_(Alphabetic_Tree_Problem_Optimal_Binary_Search_Trees)"