Melhorn's Approximation algorithm (Approximate OBST 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)$ (https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf, storing left/right subtrees' weights) == Description == == Approximate? == Approximate Approximation Factor: 0.63 H \leq P_opt \leq P_balanced \leq 2 + 1.44 H == Randomized? == No, deterministic == Model of Computation == == Year == 1975 == Reference == https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf")

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

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$

(https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf, storing left/right subtrees' weights)

Description

Approximate?

Approximate

Approximation Factor: 0.63 H \leq P_opt \leq P_balanced \leq 2 + 1.44 H

Randomized?

No, deterministic

Model of Computation

Year

1975

Reference

https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Melhorn%27s_Approximation_algorithm_(Approximate_OBST_Optimal_Binary_Search_Trees)&oldid=44350"