In the Huffman coding based on the decoding, you can restore the compressed data.
在哈夫曼编码的基础上进行解码,就可以还原压缩的数据。
Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构:编码,信息,频度,双亲,左孩子,右孩子。
Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构:编码,信息,频度,双亲,左孩子,右孩子。
应用推荐