Huffman tree structure to achieve the Huffman algorithm.
实现构造哈夫曼树的哈夫曼算法。
Solving the structure of the Huffman tree with the right to use the path length.
求解出所构造的哈夫曼使用树的带权路径长度。
Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构：编码，信息，频度，双亲，左孩子，右孩子。
Huffman algorithm we use to establish a Huffman tree (the optimal binary tree), while the frequency of the data as the weights assigned to Huffman tree nodes.
我们利用哈夫曼算法建立一棵哈夫曼树(最优二叉树)，同时将数据出现的频率作为权值赋给哈夫曼树中的结点。
Generally, the storage of Huffman coding and the way of creating Huffman tree, which not only influence the coding efficiency, but also do not fully make use of the storage space.
一般情况下，哈夫曼编码所采用的存储结构及构树方法，不仅影响编码效率，而且也没充分利用存储空间。
The method gets a data structure for storing static Huffman coding by preordering traverse Huffman binary tree and recording the course of traverse.
该方法通过先序遍历哈夫曼树，记录遍历过程，得到存储哈夫曼码表的一种数据结构。
Traditional Huffman coding is structured in the way of tree pattern, using the chain or static chain structure in algorithm, and every node in space has left, right tree and parents Pointers.
传统哈夫曼编码借助树形结构构造，算法实现时使用链表或静态链表结构，空间的每个结点内有左、右子树、双亲指针。
Summary of design: the procedures used by the data structure is linear tree and table, the algorithm used by the main sculpture, in order Huffman algorithm.
概要设计：本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。
This algorithm is totally different from previous huffman algorithm in the operation process of optimizing binary tree.
该算法在使二叉树达到最优的运算过程中，完全区别于以往的哈夫曼算法。
This algorithm is totally different from previous huffman algorithm in the operation process of optimizing binary tree.
该算法在使二叉树达到最优的运算过程中，完全区别于以往的哈夫曼算法。
应用推荐