Description: The application of the binary tree- Ha Fuman tree, keyboard input a series of strings, it is best not more than 10 Enter the corresponding frequency output, at the same time, according to the left calendar change, the frequency of the output of the order of sequence! ! Very simple-Binary Tree- Havermann Tree Application has been tested.
To Search:
File list (Check if you may need any files):
BHuffmanTreei\二叉树的应用\Debug\main.obj
.............\............\.....\main.obj.enc
.............\............\.....\vc60.idb
.............\............\.....\vc60.pdb
.............\............\.....\二叉树的应用.exe
.............\............\.....\二叉树的应用.ilk
.............\............\.....\二叉树的应用.pch
.............\............\.....\二叉树的应用.pdb
.............\............\.....\电文.txt
.............\............\.....\编码.txt
.............\............\.....\译码.txt
.............\............\.....\输入.txt
.............\............\decodes.h
.............\............\elements.h
.............\............\encode.h
.............\............\filestore.h
.............\............\huffmanTree.h
.............\............\linklist.h
.............\............\main.cpp
.............\............\queue.h
.............\............\stack.h
.............\............\storeinput.h
.............\............\二叉树的应用.dsp
.............\............\二叉树的应用.dsw
.............\............\二叉树的应用.ncb
.............\............\二叉树的应用.opt
.............\............\二叉树的应用.plg
.............\............\电文.txt
.............\............\编码.txt
.............\............\译码.txt
.............\............\输入.txt
.............\............\Debug
.............\二叉树的应用
BHuffmanTreei