摘要
在我们的日常教学中,我们经常会对哈夫曼树的建立给出不同答案,那么是否有唯一标准答案?通过相关程序流程及代码实验,分析了导致认为创建哈夫曼树不唯一的原因,说明了在一种既定的算法下,我们是可以达到哈夫曼树建立的唯一性的.
There are many case in our daily education work : people often find that they can work out different answers for a creation of binary tree by Huffman algorithm . The program flow and codes explain the reason why some people can not work out the same answer based on Huffman algorithm ,and finally , prove that we can get a unique binary tree by the Huffman algorithm.
出处
《电脑知识与技术（过刊）》
2007年第20期442-443,共2页
Computer Knowledge and Technology
关键词
哈夫曼树
哈夫曼算法
权值
唯一性
Binary tree based on Huffman algorithm
Huffman algorithm
weight
Uniqueness
