#include <iostream>
#include <cstdlib>
#include<stack>
#include<stdio.h>
#include<string.h>
using namespace std;
typedef struct {
int weight;
int parent, leftChild, rightChild;
} HTNode,*Huffmantree;
const int n=4;//叶子节点数
const int m=2*n-1;//总结点数
typedef char **Huffmancode;
void CreateHuffmanTree ( HTNode* T, int fr[ ] )
{
for ( int i = 0; i < n; i++ )
T[i].weight = fr[i];
for ( int i = 0; i < m; i++ )
{
T[i].parent = -1;
T[i].leftChild = -1;
T[i].rightChild = -1;
}
for ( int i = n; i < m; i++ )
{
int min1=100 , min2 = 100;
int pos1=0, pos2=0;
for ( int j = 0; j < i; j++ )
if ( T[j].parent == -1 )
{
if ( T[j].weight < min1 )
{
pos2=pos1;min2=min1;
pos1 = j; min1 = T[j].weight;
}
else if ( T[j].weight < min2 )
{
pos2 = j; min2 = T[j].weight;
}
}
T[i].leftChild = pos1;
T[i].rightChild = pos2;
T[i].weight = T[pos1].weight + T[pos2].weight;
T[pos1].parent = T[pos2].parent = i;
}
}
void showhuffmantree(HTNode *T)
{
printf("weight parent lchild rchild\n");
for(int i=0;i<m;i++)
{
printf("%6d %6d %6d %6d\n ",T[i].weight,T[i].parent,T[i].leftChild,T[i].rightChild);
}
return;
}
void Huffmancoding(HTNode *T)
{
Huffmancode HC=(Huffmancode)malloc((n+1)*sizeof(char *));
char* cd=(char*)malloc(n*sizeof(char));
cd[n-1]='\0';
for(int i=0;i<=n;++i)
{
int start=n-1;
int c,f;
for(c=i,f=T[i].parent;f!=-1;c=f,f=T[f].parent)
if(T[f].leftChild==c)
cd[--start]='0';
else
cd[--start]='1';
HC[i]=(char*)malloc((n-start)*sizeof(char));
strcpy(HC[i],&cd[start]);
}
for(int i=0;i<n;i++)
printf("%d : %s\n",T[i].weight,HC[i]);
free(cd);
return;
}
int main()
{
HTNode T[m];
int a[n]={3,9,5,2};
CreateHuffmanTree ( T, a);
showhuffmantree(T);
Huffmancoding(T);
return 0;
}
06-18
275
04-26
1136