摘要
给出了一种简单而有效地构造任意k元最优Huffman树的新方法。给出了Huffman村存贮的父母一子女环结构，该结构空间利用率高，在不增加parent域的情况下，使查找父母的T（m）达到O（1），并能高效实现建立最优Huffman树和求Huffman编码的算法，无论是空间复杂度还是时间复杂度均优于传统算法，具有很强的实用性。
A simple and powerful method of construction arbitrary optimal Huffman trees with k elements is given. A new Huffman tree's storage structure which is named parent--children cycling is proposed. It makes seeking a parent node with not given an extra field accomplished with O(1),and brings algorithm into good effect on construction optimal Huffman trees and Huffman codes. It has clear advantages over the traditional algorithm,either in the time complexity or in the space complexity.
出处
《航空计算技术》
1998年第4期12-15,共4页
Aeronautical Computing Technique
关键词
父母-子女环
存贮结构
编码
K元Huffman树
Parent-children cycling storage structure Huffman trees with k elements Huffman code Time complexity T(m) Space complexity S(m)
