该源程序是用动态规划算法求解最优二叉搜索树问题-the source is dynamic programming algorithm for optimal binary search tree problem

vs2010实现的OBST算法，最优二叉搜索树 实现功能： 1、文件读取，手动输入，数据更新。 2、p/q表数据保留，便于手动添、删或修改 3、最优解的二叉树结构显示 文件读取示例文档在压缩包内-vs2010 achieve OBST algorithm, optimal binary search tree implementation functions: 1, file read, manually entered data updates. 2, p/q table

给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman Tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。-Given n weights as leaf nodes n, constructing a binary tree. If the right path length to a minimum, said such a binary tree for the optimal binary tre

构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树-Construct a binary tree, if the weighted path length to a minimum, so called binary tree is optimal binary tree, also known as Huffman