哈夫曼编码是一种编码方式，它是根据每一个字符出现的概率而建立起来的。哈夫曼编码借助树形结构构造，算法实现时使用链表或静态链表结构，空间的每个结点内有左子树、右子树、双亲指针。在构成哈夫曼树之后，为求编码需从叶子结点出发走一条从叶子到根的路径；而为译码需从根出发走一条从根到叶子的路径。-Huffman coding is an encoding method, which is the emergence of each of the probability of a character built up. Huffman coding with tree structure, algorithms used to realize a static list or linked list structure, the space within each node has left subtree, right subtree, parent pointer. After the Huffman tree in the pose, for the sake of coding from the leaf node from the starting to follow a path leaves to the root　for decoding starting from the root to take a leaf from the root to the path.