Description: Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.
To Search:
File list (Check if you may need any files):
最优二分检索树.doc
Download