Description: Huffman coding, the establishment of the tree structure, and 0101 marked by the weight of each node for each node is encoded, similar to a telegram
When encoding.
To Search:
File list (Check if you may need any files):
数据结构4\1.c
.........\1.dsp
.........\1.dsw
.........\1.ncb
.........\1.opt
.........\1.plg
.........\CodeFile.txt
.........\Debug\1.exe
.........\.....\1.ilk
.........\.....\1.obj
.........\.....\1.pch
.........\.....\1.pdb
.........\.....\vc60.idb
.........\.....\vc60.pdb
.........\.....\数据结构1111.exe
.........\.....\数据结构1111.ilk
.........\.....\数据结构1111.pch
.........\.....\数据结构1111.pdb
.........\hfmtree.txt
.........\ToBeTran.txt
.........\数据结构1111.dsp
.........\数据结构1111.dsw
.........\数据结构1111.ncb
.........\数据结构1111.opt
.........\数据结构1111.plg
数据结构实验报告示例---曹辉1.doc
........4\Debug
数据结构4