1. A method for storing node information of a Huffman tree, the method comprising: creating an index of each node in the Huffman tree using a breadth first search (BFS) algorithm, each node comprising a return value; reading each node of the Huffman tree beginning from a root node according to a sequence of the index of each node; and storing node information of each node into an array of the Huffman tree, the node information of each node being stored with a first part and a second part into the array of the Huffman tree, the second part being used to determine if the node is an internal node or a leaf node of the Huffman tree.