数据结构哈夫曼编码.doc

#include <>
#include <>
#include <>
#include ""
#define MaxBit 100
(j=myHaffCode[m].start;j<n;j++)
printf("%d",myHaffCode[m].bit[j]);
printf("\n");
}
}

#ifndef Haffman_H_INCLUDED
#define Haffman_H_INCLUDED
#define MaxN 300
#define MaxValue 10000
typedef struct
{
int weight; //权值
int flag; //标记
int parent; //双亲结点下标
int leftChild; //左孩子下标
int rightChild; //右孩子下标
}HaffNode; //哈夫曼树的结点结构
typedef struct
{
int bit[MaxN]; //数组
int start; //编码的起始下标
int weight; //字符的权值
}Code; //哈弗曼编码的结构
void Haffman(int weight[],int n,HaffNode haffTree[])
//建立叶节点个数为n，权值数组为weight的哈弗曼树haffTree
{
int i,j,m1,m2,x1,x2;
//哈夫曼树haffTree初始化，n个叶节点的二叉树共有2n-1个结点
for(i=0;i<2*n-1;i++)
{
if(i<n) haffTree[i].weight=weight[i];
else haffTree[i].weight=0;
haffTree[i].parent=-1;
haffTree[i].flag=0;
haffTree[i].leftChild=-1;
haffTree[i].rightChild=-1;
}
//构造哈弗曼树的n-1个非叶节点
for(i=0;i<n-1;i++)
{
m1=m2=MaxValue;
x1=x2=0;
for(j=0;j<n+i;j++) //找出权值最小和次小的子树
{
if((haffTree[j].weight<m1) && (haff