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.
You may also enjoy
Scala Curated
A curated list of Scala materials.
Python Curated
A curated list of Python materials.
System Design Curated
A Curated List of System Design Resources.
Online Algorithm Courses
A list of algorithm courses taught online and their exercise solutions.
Leave a comment