| 对哈夫曼树唯一性的探讨 |
| |
| 引用本文： | 沈音乐. 对哈夫曼树唯一性的探讨[J]. 数字社区&智能家居, 2007, 0(20) |
| |
| 作者姓名： | 沈音乐 |
| |
| 作者单位： | 杭州职业技术学院,浙江,杭州,310018 |
| |
| 摘 要： | 在我们的日常教学中,我们经常会对哈夫曼树的建立给出不同答案,那么是否有唯一标准答案?通过相关程序流程及代码实验,分析了导致认为创建哈夫曼树不唯一的原因,说明了在一种既定的算法下,我们是可以达到哈夫曼树建立的唯一性的.
|
| 关 键 词： | 哈夫曼树 哈夫曼算法 权值 唯一性 |
Discussion on the Uniqueness for Create the Binary Tree by Huffman Algorithm |
| |
| SHEN Yin-yue. Discussion on the Uniqueness for Create the Binary Tree by Huffman Algorithm[J]. Digital Community & Smart Home, 2007, 0(20) |
| |
| Authors: | SHEN Yin-yue |
| |
| Abstract: | 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. |
| |
| Keywords: | Binary tree based on Huffman algorithm Huffman algorithm weight Uniqueness |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
