Description: With minimal programming stack to the next set of predetermined weights corresponding Huffman tree configuration algorithm, and solves the following issues: a common message using five characters a, b, c, d, e, frequency of occurrence order of 4,7 , 5,2,9. (1) the code corresponding to the Huffman tree structure (claim of the left subtree root node weights less right subtree root node). (2) give each character Huffman coding. (3) the corresponding translated code sequence 11000111000101011 the message.
To Search:
File list (Check if you may need any files):
第五次上机作业孔令芝201511210132\five.h
................................\main.cpp
第五次上机作业孔令芝201511210132
Download