数据结构二叉树遍历实验报告资料

1、v1.0可编辑可修改v1.0可编辑可修改v1.0可编辑可修改v1.0可编辑可修改 void HuffCoding(struct BTreeNode* FBT, int len) static int a50;char tmp;FILE *fp;int i;if(len = 0) fp=fopen(,w);if(fp=fopen(,a) = NULL) printf(文件打开失败!if (FBT != NULL) if (FBT-left = NULL & FBT-right = NULL) printf(%c霍夫曼编码为：，FBT-symbol);fputc(FBT-symbol,fp);fp

2、utc(t,fp);for (i = 0; i left, len + 1);alen = 1; HuffCoding(FBT-right, len + 1);n);exit(1);fclose(fp);n);exit(1);848584858687888990919293949596979899100101102103104105106107108109void TransCode(FILE *src) FILE *fp1,*fp2;char ch1,ch2;if(fp1=fopen(,r) = NULL) printf(文件打开失败！if(fp2=fopen(,w) = NULL) pri

3、ntf(文件打开失败！fseek(src,0L,SEEK_SET);chi = fgetc(src);ch2 = fgetc(fpl);while (chi != EOF)if (ch164 & ch196 & ch1123) while(ch2 != EOF) if(ch2 = ch1)fgetc(fpl);ch2=fgetc(fp1);while(ch2!=n)fputc(ch2,fp2);ch2=fgetc(fp1);fputc(t,fp2);break;ch2 = fgetc(fpl);if(ch2 = EOF) printf(未找到对应编码！n);n);exit(1);n);exit

4、(1);n);exit(1);n);exit(1);110111110111112113114115116117118119120121122123124125126127128129ch2 = fgetc(fpl);chi = fgetc(src);fclose(fpl);fclose(fp2);void main(void)char chs100;int ch_freq100 = 0;struct BTreeNode* T;FILE *fp;if(fp=fopen(,r) = NULL) printf(文件打开失败!CountChar(fp,chs,ch_freq);T = CreateH

5、uffman(ch_freq,strlen(chs),chs);HuffCoding(T,0);TransCode(fp);fclose(fp);n);exit(1);4.运行结果n);exit(1); C;VVir dowssy5te m 3 2cmd.exe43261111-22243213 s t fl p g F -L h LEF Gud nba0000 WU1 001 0100 0101 mi 100 1019 1011 11UUJ110R1 A 110011 1101111MJ 11101A 111011 iiiiee lilial milE E ! I ! : ? ; i : !

6、 i- - 2 = : : 7rv.?.3ra.z7rv;7rv,3rx.315Txd7 d7 .主- rJ?rf?dT 弓 3rJTTJ?3 马 rrpld?3r:f?3 马马 33ld7 ? ? Jr 千可可 r*x. llr h- 4r-/一 %曷显忖同辰辰身届的lELEEKM晶易品las/上 ktEgc、E,.E1c,E14-t.ELcE14?ElE,.E1 土 斗孑m 3 .ML.4 y 寸寻 1 隼勇wfwli kuu-d n 吐O-M 5 Ak登 L L g h L * b F 今crd-er.huf - 记事本1100101101011010111100011100110011111001110101101111011111100111111101010110001100000001010100101110