Introduction - If you have any usage issues, please Google them yourself
Dynamic Programming dictionary order to construct the optimal binary tree, carefully your memory ah!
Packet : 27796733project3finishok.rar filelist
Project3finishOK\Debug\Dictionary.txt
Project3finishOK\Debug\main.obj
Project3finishOK\Debug\OBSTNode.obj
Project3finishOK\Debug\OBSTree.obj
Project3finishOK\Debug\Project3.exe
Project3finishOK\Debug\Project3.ilk
Project3finishOK\Debug\Project3.pch
Project3finishOK\Debug\Project3.pdb
Project3finishOK\Debug\test.txt
Project3finishOK\Debug\vc60.idb
Project3finishOK\Debug\vc60.pdb
Project3finishOK\Debug
Project3finishOK\Dictionary.txt
Project3finishOK\Dictionary.txt.bak
Project3finishOK\main.cpp
Project3finishOK\OBSTNode.cpp
Project3finishOK\OBSTNode.h
Project3finishOK\OBSTree.cpp
Project3finishOK\OBSTree.h
Project3finishOK\Project3.dsp
Project3finishOK\Project3.dsw
Project3finishOK\Project3.ncb
Project3finishOK\Project3.opt
Project3finishOK\Project3.plg
Project3finishOK\test.txt
Project3finishOK