CSE201, Winter 2025, Lec 8: Optimal BSTs
C. Seshadhri · 90:31
Optimal binary search trees can be computed exactly with dynamic programming: given an ordered key set and known lookup frequencies, try every legal root on each interval, recurse on the two sides, and add the interva...