void Coding(HuffmanTree T, int i, SqStack &S,char *HC) //先序遍历huffman树获取每个字符的huffman编码 if(T.Htree[i].lchild==-1 & T.Htree[i].rchild==-1){ //i是树叶 push(S, \0; //字符串结束标志\0进栈 HC[i]=new char[StackLength(S)]
毕业答辩PPT模板合集
