文件名称:6-48
介绍说明--下载内容均来自于网络,请自行研究使用
构造任意k元(k≥2)Huffman树算法,k元哈夫曼树的构造与2元哈夫曼树的构造相同,差别只在于k元哈夫曼树需考虑虚设的0的个数。-Construct an arbitrary k-ary (k ≥ 2) Huffman tree algorithm, k element of the Huffman tree structure with two yuan the same Huffman tree structure, the difference lies in k-ary Huffman tree to be considered hypothetical number of 0.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
6-48.cpp