Using binary tree structure to achieve Huffman encoder/decoder. Basic requirements: 1 Initialization: the ability to input a string of arbitrary length s statistical, statistical frequency of each character, and the establishment of Huffman tree 2, the coding table: the use of the Huffman tree has been built to encode, and encoding each character output. 3, code: According to the code table to encode the input string and output the encoded string. 4, decoding: use of the Huffman tree has been built on the encoded string decoding, and outputs decoding result. 5, print: the intuitive way to print Huffman tree (chosen as) 6 to calculate the input code string length before and after coding, and analysis, discussion of Huffman coding compression.

huffman\CodeFile.txt
.......\Debug\huffman.bsc
.......\.....\huffman.exe
.......\.....\huffman.ilk
.......\.....\huffman.pch
.......\.....\huffman.pdb
.......\.....\main.obj
.......\.....\main.sbr
.......\.....\newfunction.obj
.......\.....\newfunction.sbr
.......\.....\oldfunction.obj
.......\.....\oldfunction.sbr
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\HuffCode.txt
.......\huffman.dsp
.......\huffman.dsw
.......\huffman.ncb
.......\huffman.opt
.......\huffman.plg
.......\main.cpp
.......\newfunction.cpp
.......\old.h
.......\oldfunction.cpp
.......\resource.h
.......\Script1.aps
.......\Script1.rc
.......\SourceFile.txt
.......\Debug
huffman

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．