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 .

而且每棵哈夫曼树都必须有以下结构：编码，信息，频度，双亲，左孩子，右孩子。

youdao

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 .

而且每棵哈夫曼树都必须有以下结构：编码，信息，频度，双亲，左孩子，右孩子。

youdao