赫夫曼树遍历算法的优化  

Optimization of Huffman Tree Traversal Arithmetic

作　　者：徐莹[1] XU Ying （Anhui Vocational college of Electronics and Information Technology, Bengbu 233000, China）

机构地区：[1]安徽电子信息职业技术学院软件学院,安徽蚌埠233000

出　　处：《电脑知识与技术》2009年第9期7235-7237,共3页Computer Knowledge and Technology

摘　　要：对数据结构中赫夫曼树和赫夫曼遍历的算法问题进行探讨，针对传统使用的遍历算法存在循环次数较多、算法时间复杂度较大问题，通过修改参数和循环体结构对原有算法进行改进，从而减少循环次数，降低算法时间复杂度，同时也提出了动态编码算法等的优点和可行性。Investigating into data structure about Huffman tree and Huffman traversal arithmetic, It is discovered that there are many problems such as much more cycle and much higher time complexity in traditional traversal algorithm, the thesis submits a improved algorithm to reduce the cycles and time complexity through altering parameter and structure of loop body, and further promote the advantage and feasibility of dynamic encoder.

关 键 词：赫夫曼树 赫夫曼编码 算法时间复杂度 静态编码算法 参数 循环体 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论;自动化与计算机技术—计算机科学与技术]