文件名称:hafuman
- 所属分类：
- 数据结构常用算法
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1kb
- 下载次数：
- 0次
- 提 供 者：
- wangs******
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
输入一个有n个叶结点的权植构造一棵哈夫曼树:(例如:n=8,权植为 5 29 7 8 14 23 3 11)根据哈夫曼树构造哈夫曼编码,用指向字符串的指针数组来存放,用叶子到树根逆向求每个结点的哈夫曼编码.
-Enter one has n leaf nodes of the right to construct a Huffman tree-sik: (For example: n = 8, the right-sik for 529,781,423,311) Huffman tree constructed in accordance with Huffman coding, with indicators point to a string array to store and use the leaves to the roots reverse order each node of the Huffman coding.
-Enter one has n leaf nodes of the right to construct a Huffman tree-sik: (For example: n = 8, the right-sik for 529,781,423,311) Huffman tree constructed in accordance with Huffman coding, with indicators point to a string array to store and use the leaves to the roots reverse order each node of the Huffman coding.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
hafuman.c