In the Java implementation of a Huffman tree application, can according to the following each character frequency (weights) {Spaces and the occurrence of 26 English letters are: 186,64,13,22,32,103,21,15,47,57,1,5,32,20,57,63,15,1,48,51,80,23,8,18,1,16,1} to create a Huffman tree (left child of value less than or equal to the weight of the right child weight); And output all message encoding of the characters, and will be "THIS PROGRAM IS MY FAVORITE" coding, statistics the total length of message transmission, on THIS basis, for the user to enter the 01 series, answer it represents a string (that IS, the message decoding), reply if decoding failure criterion "decoding failure"

CodePudding user response:

See you have ideas