| 动态规划法构建最优二叉查找树的研究 |
| |
| 引用本文： | 吕聪颖.动态规划法构建最优二叉查找树的研究[J].计算机与现代化,2012(4):145-147,151. |
| |
| 作者姓名： | 吕聪颖 |
| |
| 作者单位： | 南阳理工学院计算机科学与技术系,河南南阳,473004 |
| |
| 基金项目： | 国家自然科学基金青年科学基金资助项目(81101490) |
| |
| 摘 要： | 提出动态规划法构建最优二叉查找树的算法模型,并对其进行改进,构造实例表明算法的有效性。
|
| 关 键 词： | 动态规划 最优二叉查找树 最优子结构 |
Research on Optimal Binary Search Tree Constructed by Dynamic Programming |
| |
| Lü Cong-ying.Research on Optimal Binary Search Tree Constructed by Dynamic Programming[J].Computer and Modernization,2012(4):145-147,151. |
| |
| Authors: | Lü Cong-ying |
| |
| Affiliation: | Lu Cong-ying(Department of Computer Science and Technology,Nanyang Institute of Technology,Nanyang 473004,China) |
| |
| Abstract: | This paper presents the module of dynamic programming for optimal binary search tree,and improves the algorithms.Instance result shows the algorithm is effective. |
| |
| Keywords: | dynamic programming optimal binary search tree optimal substructure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
