一般情况下，哈夫曼编码所采用的存储结构及构树方法，不仅影响编码效率，而且也没充分利用存储空间。

Generally, the storage of Huffman coding and the way of creating Huffman tree, which not only influence the coding efficiency, but also do not fully make use of the storage space.

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

根据建立好的哈夫曼树我们进行编码，从根结点出发在左子树则标为0，右则标为1。

According to our well-established Huffman coding, starting from the root node in the left subtree is marked as 0, the right is labeled 1.

youdao