Another Algorithm of Huffman Coding

Traditional Huffman coding is structured in the way of tree pattern,using the chain or static chain structure in algorithm,and every node in space has left,right tree and parents pointers.This paper presents another algorithm of Huffman coding which removes tree pattern structure,using an array to simulate the creation process of binary tree so as to obtain the depth of the symbol,and then each symbol is assigned a code according to this information.For the full-length text,the space needed in the process of coding and decoding will much less than in the traditional Huffman coding.