哈夫曼树算法的改进

Improvement of Huffman Tree Algorithm

目前,在通信过程中哈夫曼编码是一种高效的编译码之一。而构造哈夫曼编码的前提是建立哈夫曼树,并且哈夫曼树还应用于最佳判定树。哈夫曼树的算法在实际应用中是非常广泛的。该文探讨了哈夫曼树的算法,并且对它进行了改进,从而提高该算法的时间复杂度。

At present,Huffman coding is one of an efficient coding-decoding in the communication process.But building a Huffman tree is the premise of structure Huffman coding .And the Huffman tree is also used in best decision tree.Huffman tree algorithm in practical applications is very broad.This paper investigated the Huffman tree algorithm and improved it.Therefore time complexity of the algorithm is improved.