给出了一种简单而有效地构造任意k元最优Huffman树的新方法。给出了Huffman村存贮的父母一子女环结构，该结构空间利用率高，在不增加parent域的情况下，使查找父母的T（m）达到O（1），并能高效实现建立最优Huffman树和求Huffman编码的算法，无论是空间复杂度还是时间复杂度均优于传统算法，具有很强的实用性。 A new method to construct any k-th optimal Huffman tree simply and effectively is given. The parent-child ring structure stored in Huffman village is given. The structure space utilization rate is high, and the parent finding T (m) can reach O (1) without increasing the parent region, and can be efficiently established The optimal Huffman tree and Huffman coding algorithm are superior to traditional algorithms in both space complexity and time complexity.