哈夫曼树可用于构造使电文的编码总长最短的编码方案。具体做法如下：设需要编码的字符集合为{d1，d2，…，dn}，它们在电文中出现的次数或频率集合为{w1，w2，…，wn}，以d1，d2，…，dn作为叶结点，w1，w2，…，wn作为它们的权值，构造一棵哈夫曼树，规定哈夫曼树中的左分支代表0，右分支代表1，则从根结点到每个叶结点所经过的路径分支组成的0和1的序列便为该结点对应字符的编码，我们称之为哈夫曼编码。-Huffman encoding can be used to construct the shortest length of the message' s encoding scheme. Specifically, the following: Let coded character set needed for the {d1, d2, ..., dn}, number or frequency in which they appear in the message set is {w1, w2, ..., wn}, with d1, d2, ..., dn a leaf node, w1, w2, ..., wn as their weights, a Huffman tree structure, the predetermined Huffman tree represents 0 left branch and right branch represents 1, from the root to every sequence of a leaf node path through a branch consisting of 0 and 1, then the corresponding node encoded characters that we call Huffman coding.