*讨论

  * 本PKZIP“通缩”的过程中使用了几个哈夫曼树。越

  *共源的值由短比特序列表示。

  *

  *每个代码树存储在ZIP文件以压缩形式

  *这是本身的长度的霍夫曼编码

  *所有的代码串（按升序排列按来源值）。

  *实际代码串从长度重构

  *解压缩过程中，如在“应用指南”中描述

  *（APPNOTE.TXT）分布情况的PKWARE的PKZIP的计划的一部分。-*　trees.c by Jean-loup Gailly

*

*　This is a new version of im_ctree.c originally written by Richard B. Wales

*　for the defunct implosion method.

*

*　PURPOSE

*

*　　　Encode various sets of source values using variable-length

*　　　binary code trees.

*

*　DISCUSSION

*

*　　　The PKZIP　deflation　process uses several Huffman trees. The more

*　　　common source values are represented by shorter bit sequences.

*

*　　　Each code tree is stored in the ZIP file in a compressed form

*　　　which is itself a Huffman encoding of the lengths of

*　　　all the code strings (in ascending order by source values).

*　　　The actual code strings are reconstructed　the lengths in

*　　　the UNZIP process, as described in the　application note

*　　　(APPNOTE.TXT) distributed as part of PKWARE s PKZIP program.