主要介绍了Ruby实现的最优二叉查找树算法,本文直接给出实现代码,需要的朋友可以参考下

算法导论上的伪码改写而成，加上导论的课后练习第一题的解的构造函数。 代码如下: #encoding: utf-8 =begin author: xu jin date: Nov 11, 2012 Optimal Binary Search Tree to find by using EditDistance algorithm refer to example output: “k2 is the root of the tree.” “k1 is the left child of k2.