Huffman coding based on a binary sort tree

The traditional way to achieve huffman coding is from leaf nodes to the root node on the basis of the huffman tree.In order to improve coding efficiency,It prsents a new implementation approach of the huffman coding,in which codes go from the root node to leaf nodes of the huffman tree by using the binary sort tree.In the coding process,every leaf node is only scanned once before getting the huffman coding.This method not only coincides with the thinking of encoding mode,and solves the problem of a large number of pointers' movement.