hcode.txt

实现最优二叉树的构造；在此基础上完成哈夫曼编码器与译码器。 假设报文中只会出现如下表所示的字符： 字符 A B C D E F G H I J K L M N 频度 186 64 13 22

10110000100000100110011011010110010000101110011111100111111001000111011100110111111010101001101010101100101111000001001101110100111011100010000110001110001010001101001@10110010000110111001100100011101110111101100100111101011100111111101111011000101101010010011011011100001100101100101000111010101@1011000010000010011011100010000011111110011110101011000011111000101001100110111111010101001100101011001000111011101000101011001010001110111111110@011011101101011101000101111100001101011100001100101101110011010101000101101110@