数据结构哈夫曼树的代码

}htnode;
htnode ht[maxval];
typedef struct{
char cd[10];
}huffmancode;
huffmancode hc[maxval];
int n,maxline;
int cnt[27];
char exp[256], str[27];
}
void Decoding()
{ FILE *fp;
char ch;
int k=0,start;
char filename[20];
printf("please input filename:codefile.txt\n");
scanf("%s",filename);
}
min1=32767;
for (j=0;j<i;j++)
if(ht[j].weight<min1 && ht[j].parent==0 && j!=s1)
{
s2=j;min1=ht[j].weight;
{
while((ht[k].lchild!=0)||(ht[k].rchild!=0))
{
ch=fgetc(fp);
if(ch=='0') k=ht[k].lchild;
}
void Print_code()
{
int i;
printf("每种字符的前缀编码:\n");
for(i=0;i<n;i++)
{
printf("%c\t%s\n",ht[i].ch,hc[i].cd);
}
}
int Menu_select()
}
ht[s1].parent=i;ht[s2].parent=i;
ht[i].lchild=s1; ht[i].rchild=s2;
ht[i].weight=ht[s1].weight+ht[s2].weight;
}
else if(ch=='1') k=ht[k].rchild;
}
printf("%c",ht[k].ch);k=2*n-2;
}
}
void Print_hufmantree()
}
void Creat_huffmancode()
{
int c,p,i;
char cd[10];
int start;
for(i=0;i<n;i++)
{
start=n-1;
cd[start]='\0';
}
printf("Got string!\n");
fclose(fp);
}
void Read_txt()
{
FILE *fp;
int i = 0;
char ch;
char filename[20];
printf("please input filename:a.txt\n");
c=i;
p=ht[i].parent;
while(p>0)
{
if(ht[p].lchild==c)
cd[--start]='0';
else
cd[--start]='1';
{
int i,j,m,s1,s2;
m=2*n-1;
for(i=0;i<n;i++)
{
ht[i].ch=str[i];
ht[i].weight=cnt[i];
ht[i].lchild=0;
ht[i].parent=0;
{
int i;
printf("哈夫曼树的终态:\n");
for(i=0;i<2*n-1;i++)
printf("%c\t%d\t%d\t%d\t%d\n",ht[i].ch,ht[i].weight,
ht[i].lchild,ht[i].parent,ht[i].rchild);
{
printf("can't open file!\n");
exit(0);
}
printf("请输入待编码的内容(以'#'键结束输入):\n");
ch=getchar();
while(ch!='#')
{
fputc(ch,fp);
ch=getchar();
k=ch-'a';
temp[k]++;
}
}
for(i=0;i<26;++i)
if(temp[i]!=0 )
{
str[j]=(char)(i+'a');
{
ch=fgetc(fp);
exp[i++]=ch;
}
exp[i]='\0';
maxline = i;
fclose( fp );
}
void Count_char()
{
int i,j=0,k;
char ch;
{
printf("can't open file!\n");
exit(0);
}
printf("文件中的编码内容为:\n");
for(i=0;i<maxline-1;i++)
{
for(j=0;j<n;j++)
}
for(i=n;i<m;i++)
{
int min1=101;
for(j=0;j<i;j++)
if(ht[j].weight<min1 &&ht[j].parent==0)
{
s1=j;min1=ht[j].weight;
FILE *fp;
char p[10];
char filename[20];
printf("please input filename:codefile.txt\n");
scanf("%s",filename);
if((fp=fopen(filename,"w"))==NULL)
c=p;
p=ht[p].parent;
}
strcpy(hc[i].cd,&cd[start]);
}
free(cd);
}
void Encoding()
{
int i,j,k;
{ char c;
int i;
do{
system("cls");
system("graftabl 936");
printf("\t****************************************************************");
if((fp=fopen(filename,"r"))==NULL)
{
printf("can't open file!\n");
exit(0);
}
k=2*n-2;
printf("译码为:\n");
while(ቤተ መጻሕፍቲ ባይዱfeof(fp))
printf("\t | 3. 形成哈夫曼树并打印 |\n");
printf("\t | 4. 求每种字符对应的前缀编码并打印 |\n");
printf("\t | 5. 对电文编码并写入codefile.txt文件中 |\n");
printf("\t\t\t**哈夫曼编码译码器!**\n");
printf("\t | 1. 输入要编码的内容并写入a.txt文件中 |\n");
printf("\t | 2. 从文件中读取电文统计字母及频度 |\n");
if(exp[i]==ht[j].ch)
{
k=j;}
strcpy(p,hc[k].cd);
fputs(p,fp);
printf("%s",p);
}
fclose(fp);
printf("\t | 6. 从codefile.txt中读取编码并对其译码打印出来 |\n");
#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#include<string.h>
#define maxval 1000
typedef struct{
char ch;
int weight;
int lchild,parent,rchild;
ht[i].rchild=0;