Description: 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.
To Search:
File list (Check if you may need any files):
6-48.cpp
Download