哈夫曼编码的应用很广泛，利用哈夫曼树求得的用于通信的二进制编码称为哈夫曼编码。树中从根到每个叶子都有一条路径，对路径上的各分支约定：指向左子树的分支表示“0”码，指向右子树的分支表示“1”码，取每条路径上的“0”或“1”的序列作为和各个对应的字符的编码，这就是哈夫曼编码。-Huffman coding application is comprehensive, the use of Huffman tree obtained is called binary code used for communication Huffman coding. Tree from the root to each leaf has a path, the path of each branch of the convention: the left sub-tree branches that said " 0"　code means that the right sub-branch of the tree, " 1"　bit, take each path " 0"　or " 1"　and each corresponding to a sequence of characters as the encoding, which is Huffman coding.