w取什么值能保证算法是完备的答:void HuffmanCoding(HuffmanTree &HT,HuffmanCode&HC,int *w,int n){ int m,i,s1,s2,start,c,f;HuffmanTree p;if(n<=1)return;m=2*n-1;//由叶数计算结点总数 HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));//配存储空间 for(p=HT+1,i=1;i<=n;++i,++p,++w){ p->weight...