北邮数据结构上机实验-哈夫曼树（国外英文资料）.docVIP

北邮数据结构上机实验-哈夫曼树（国外英文资料） / * 2.2 topic 2 - applied experiment Use binary tree structure to implement haffman/decoder. Basic requirements: Initialization (Init) : the ability to count the string s of any length in the input, to count the frequency of each character, and to establish the Huffman tree Create a coding table (CreateTable) : code with the already built haffman tree and output each characters code. Encoding (Encoding) : Encoding the input string according to the code table and output the encoded string. Decoding: use the already built haffman tree to decode the encoded string and outp