# Homework 3 Optional Problems

Give a dynamic programming algorithm that computes an optimal binary search tree and runs in $O(n^2)$ time.

ANSWER: See Optimal BST - Carnegie Mellon University.