Computer and Modernization ›› 2012, Vol. 1 ›› Issue (200): 145-03.doi: 10. 3969/j. issn. 1006-2475.2012.04.040

• 算法设计与分析 • Previous Articles     Next Articles

Research on Optimal Binary Search Tree Constructed by Dynamic Programming

LU Cong-ying   

  1. Department of Computer Science and Technology， Nanyang Institute of Technology， Nanyang 473004， China
  • Received:2011-11-08 Revised:1900-01-01 Online:2012-04-16 Published:2012-04-16

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.

Key words: dynamic programming, optimal binary search tree, optimal substructure