Yao (OBST Optimal Binary Search Trees)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ words

(https://doi.org/10.1137/0603055)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1982

Reference

https://doi.org/10.1137/0603055