迄今为止见过的最方便的huffman编码，效率很高 一个外国人写的，很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1). 2) Set

3其中“2.gif”是树的贴图，存储为GIF文件格式。这是因为要使树的最终效果更好；要把图像的背景设置为背景透明，GIF文件格式可以存储一些背景颜色并将其转换成透明性信息，而JPG的格式不能存储透明性信息。-3 of them " 2.gif" is a tree map, storage for the GIF file format. This is because the net effect of the tree to make better to set the