关于《数据结构》(C语言版)构造赫夫曼树的思考  

作　　者：方利胜 

机构地区：[1]陕西地建土地勘测规划设计院有限责任公司,陕西西安710075

出　　处：《科技创新与应用》2020年第26期65-67,共3页Technology Innovation and Application

摘　　要：目前构造赫夫曼树的方法有时会出现两种情况,而赫夫曼树又称"最优二叉树",因此应该是唯一的。文章通过比较两种赫夫曼树所生成的赫夫曼编码,阐述了两种赫夫曼树何种最优,从而实现了对现有构造赫夫曼树方法的补充和完善。At present, there are sometimes two ways to construct Huffman Tree, and Huffman Tree is also called "Optimal Binary Tree", so it should be unique. In this paper, by comparing the Huffman Codes generated by the two Huffman Trees, the best of the two Huffman Trees is explained, thus realizing the supplement and perfection of the existing method of constructing Huffman Trees.

关 键 词：赫夫曼树 赫夫曼编码 最优二叉树 数据结构 

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