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.
传统哈夫曼编码借助树形结构构造，算法实现时使用链表或静态链表结构，空间的每个结点内有左、右子树、双亲指针。
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.
传统哈夫曼编码借助树形结构构造，算法实现时使用链表或静态链表结构，空间的每个结点内有左、右子树、双亲指针。
应用推荐