数据结构中霍夫曼算法实例

#include "stdio.h"
#include "stdlib.h"
#include "string.h"
#define N 5    //权向量的个数
typedef int elemtype;
struct Tree
{
elemtype weight;
elemtype lchild;
char rchild;
elemtype parents;
};
void HuffmanTree(int *w); //构造霍夫曼树
#include "tree.h"
void HuffmanTree(int *w)
{
int i,j,k,m,x,y,n,p,f,s;
char c,*code[N],cod[N];
Tree *t;
m=2*N-2;
c=97;
t=(Tree*)malloc(m*sizeof(Tree));
for(i=1;i<N;i++) //给叶子结点赋值
{
(t+i)->weight=w[i];
(t+i)->parents=0;
(t+i)->lchild=i;
(t+i)->rchild=c;
c++;
}