Skip to content

Optimal binary search tree using dynamic programming.

Notifications You must be signed in to change notification settings

mndxpnsn/optimal-bst

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

optimal-bst

Optimal binary search tree using dynamic programming. The problem is obtained from the CLRS book, Introduction to Algorithms.