哈夫曼树

#include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
#define MaxNode 20
struct HtNode{
double weight;
int parent, leftChildren, rightChildren;
};

struct HtTree {
struct HtNode ht[MaxNode];
int root;
};

typedef struct HtTree* PHtTree;

PHtTree Huffman(int n, double w[])
{
PHtTree pht;
int i, j, p1, p2;
double min1, min2;
if(n < 1)
return NULL;
pht = (PHtTree)malloc(sizeof(struct HtTree));
for(i=0; i<n; i++)
{
pht->ht[i].parent = 0;
pht->ht[i].weight = w[i];
}
for(i=n; i<2*n-1; i++)
{
pht->ht[i].parent = 0;
pht->ht[i].weight = -1;
}
for(i=0; i<n-1; i++)
{
p1 = p2 = 0;
min1 = min2 = 9999999;
for(j=0; j<n+i; j++)
{
if(pht->ht[j].parent==0)
{
if(pht->ht[j].weight<min1)
{
min2 = min1;
p2 = p1;
min1 = pht->ht[j].weight;
p1 = j;
}
else if(pht->ht[j].weight<min2)
{
min2 = pht->ht[j].weight;
p2 = j;a
}
}

}
pht->ht[p1].parent = n+i;
pht->ht[p2].parent = n+i;
pht->ht[n+i].weight = min1 + min2;
pht->ht[n+i].leftChildren = p1;
pht->ht[n+i].rightChildren = p2;
}
return pht;
}

char** HuffmanCode(int n, PHtTree pht)
{
char c[n];
char **HC;
HC = (char**)malloc(n*sizeof(char*));
c[n-1] = '\0';
for(int i=0; i<n; i++) //进行n次循环，为n个字符序号产生对应的编码
{
int start = n - 1;
for(int k=i, f = pht->ht[i].parent; f!=0; k=f, f = pht->ht[k].parent)
{
if(pht->ht[f].leftChildren == k)
c[--start] = '0';
else
c[--start] = '1';

}
HC[i] = (char*)malloc(sizeof(char)*(n-start));
strcpy(HC[i], &c[start]);
}
return HC;
}

int main()
{

double a[] = { 5, 29, 7, 8, 14, 23, 3, 11};
int n=8;
PHtTree pht = Huffman(n, a);
char **HC;
HC = HuffmanCode(n, pht);
for(int i=0; i<n; i++)
cout << HC[i] << endl;
return 0;
}

转载于:https://www.cnblogs.com/1915884031A-qqcom/p/7521296.html