工科专业下数据结构

1、一、调试成功程序及说明编码#include#include#includetypedef structweight;parent,lchild,rchild;HTNode,*HuffmanTree;typedef char* HuffmanCode;void Select(HuffmanTree HT,n,&s1,&s2)/min1min2min1=100,min2=100;for(i=0;in;i+)if(HTi.parent=0)&(HTi.weightmin2)if(HTi.weightmin1)min2=HTi.weight;s2=i;elsemin2=min1;s2=i;void H

2、uffmanCoding(HuffmanTree &HT,HuffmanCode &HC, *w, n)char *cd;HT=(HuffmanTree)malloc(m+1)*sizeof(HTNode); m=2*n-1,s1,s2,c,f;HTi.lchild=HTi.rchild=HTi.parent=0;for(;im;i+)HTi.weight=HTi.lchild=HTi.rchild=HTi.parent=0;for(i=n;im;i+)Select(HT,i,s1,s2);HTs1.parent=i;HTs2.parent=i;HTi.lchild=s1;HTi.rchild

3、=s2;HTi.weight=HTs1.weight+HTs2.weight;for(i=0;im;i+)prf(%d:%dt%dt%dt%dn,i,HTi.weight,HTi.parent,HTi.lchild,HTi.rchild);HC=(HuffmanCode)malloc(n+1)*sizeof(char*);cd=(char *)malloc(sizeof(char)*n);cdn-1=0;for(i=0;in;i+)for(c=i,f=HTi.parent;f!=0;c=f,f=HTc.parent)if(HTf.lchild=c) cd-start=0;else cd-sta

4、rt=1;HCi=(char *)malloc(n-start)*sizeof(char);strcpy(HCi,&cdstart);free(cd);void prHuffmanCode(HuffmanCode HC,n,*w)i;for(i=0;in;i+)prf(权值为%d 的编码是 %s。n,wi,HCi);for(i=0;in;i+)HTi.weight=wi; start=n-1;main()HuffmanTree HT;HuffmanCode HC;w20,n,i;prf(请输入要编码的字母个数：n);scanf(%d,&n);prf(输入权值：n);for(i=0;inext=NULL)return 1;for(d=0,p=T.nodesr.child-next;p;p=p-next)if(sd=Depth_CT(T,p-child)d)d=sd;return d+1;孩子兄弟链表Depth_CS(CSTree T)max,d;CSNode *p;if(T=NULL)return 0;for(max=0,p=T-child;p;p=p-nextsibling)if(d=Depth_CS(p)max)max=d;return max+1;双亲链表Depth_P(PTree T)ma