数据结构试验报告---赫夫曼树

1、赫夫曼树：代码：#include<stdio.h>#include<iostream>using namespace std;#include<malloc.h>#include<stdlib.h>#include<limits.h>#include<string.h>typedef structunsigned int weight;unsigned int parent,lchild,rchild; htnode,*huffmant ree;typedef char *huffmancode;int mini (huf

2、fmantree t,int i)int j,flag;unsigned int k=uint_max;for(j=1 ；jv=i;j+)if(tj.weight<k&&tj.parer)t=o)k=tj.weight,flag=j;tflag.parent=1;return flag;void select(huffmantree t,int i,int *s1 ,int *s2) int j;*s1=min1 (t,i);*s2=min1(t,i);if(*s1>*s2)*s1=*s2;*s2=j;void huffmancoding(huffmantree *

3、ht,huffmancode *hc,int *w,int n) int m,i,s1 ,s2,start;unsigned c,f;huffmantree p;char *cd;if(n<=1)return;m=2*n-1;*ht=(huffmantree)malloc(m4-1 )*sizeof(htnode);for(p=*ht+1 ,i=1 ;iv=n;+i,+p,+w) (*p).weight=*w;(*p).parent=o;(*p).lchild=o;(*p).rchild=o;for(;iv=m;+i,+p)(*p).parent=o;for(i=n+1 ;iv=m;+i

4、)select(*ht,i-1，&s1 ,&s2);(*ht)s1.parent=(*ht)s2.parent=i;(*ht)i.lchild=s1;(*ht)i.rchild=s2;(*ht)i.weight=(*ht)s1.weight+(*ht)s2.weight;*hc=(huffmancode)malloc(n4-1 )*sizeof(char*);cd=(char*)malloc(n*sizeof(char);cdn-1='0'for(i=1 ;iv=n;i+) start=n-1;for(c=i,t=(*ht)i.parent;f!=0;c=f,f

5、=(*ht)f.parent)if(*ht)f.lchild=c)cdstart=*o*;elsecdstart='r；(*hc)i=(char*)malloc(n-start)*sizeof(char);strcpy (* hc) i, &cd start);free(cd); void main() 主程序huffmantree ht;huffmancode hc;int i,j=o,w27=186,64,13,22,32,103,21,15,47,57,1,5,32,20,57,63,15,1,48,51,80,23,8,18,1,16,1；huffmancoding(&

6、amp;ht,&h c,w,27);printf(”对应的赫夫曼编码：n”);char c='a'putchar(* ,);cout«, ,«hc1«, '«'for(i=2;iv=27;i+)putchar(c+4-);cout«f ,«hci«, *«if(j%4=0) cout«endl;printf(hn输入要翻译的句子:”);char s100;gets(s);puts(s);while(sj)if(sj=* ) cout«hc1;else co

7、ut«hcsj-,a,+2;j+;cout«endl;运行结果:对应的赫夫曼编码：110 a 1010b 100100c 00010d 10110e 010 f 111110g 100101h 000010110j 1111011100k111101101 10111nmilln 0111o1000p 100110q11110111011* 0010s0011t 1110u00011v 1111010w111100x 1111011110y100111z 1111011111输要翻译的®子:this programis ny favoritethis program isny favorite11100000011000111101001100010100