Introduction - If you have any usage issues, please Google them yourself
Less than or equal to 1, according to the input construct a Huffman tree, the requirements of the Huffman tree left subtree right subtree 2, according to the structure of the Huffman tree gives the corresponding coding left subtree coding 0, and the right sub-tree coding is 1 3, the output of the encoding and the average code lengths corresponding to each character 4, according to the coding of the input, the binding construct of the Huffman tree to give the corresponding decoding 5, with different The the weights encode characters coding table to enter ' 0' ' ' code decoding using their own implementation.