Construct Optimal Binary Search Tree by Using Greedy Algorithm

Focus on some constructions of binary tree, there are many methods to resolve this problem. With analyzes between binary search tree and Huffman tree, we introduce information retrieval issue and compare the Huffman tree with optimal binary search tree. And we further present a method that use greedy algorithm to construct binary search tree and use C++ to realize method. Experimental provides some conclusions that greedy algorithm is more efficiency than dynamic programming algorithm.