Description: Binary tree structure to achieve a Huffman encoder/decoder. Basic requirements: 1, initialize the Init: any length of the input string s statistics, statistical frequency of each character, and the establishment of the Huffman tree, to the establishment of the coding table (the CreateTable): use of already built the Huffman tree is encoded, and each character encoding output. 3, the encoding (Encoding): According to the coding table of the input string is encoded, and encoded string output. Decoding (Decoding): the use of the Huffman tree has been built to decode the encoded string, and outputs the decoding results. 5, print (the Print): an intuitive way to print the Huffman tree (option for) 6 to calculate the length of the string encoding of the input pre-encoded, and analyzed, to discuss the Huffman encoding compression.
To Search:
File list (Check if you may need any files):
哈夫曼\1.h
......\Debug\main.obj
......\.....\vc60.idb
......\.....\vc60.pdb
......\.....\哈夫曼.exe
......\.....\哈夫曼.ilk
......\.....\哈夫曼.opt
......\.....\哈夫曼.pch
......\.....\哈夫曼.pdb
......\main.cpp
......\哈夫曼.dsp
......\哈夫曼.dsw
......\哈夫曼.ncb
......\哈夫曼.opt
......\哈夫曼.plg
......\Debug
哈夫曼
Download