样例输入
8 23 15 3 7 5 14 6 27
样例输出
23 13 0 0 15 12 0 0 3 9 0 0 7 10 0 0 5 9 0 0 14 12 0 0 6 10 0 0 27 14 0 0 8 11 3 5 13 11 7 4 21 13 9 10 29 14 6 2 44 15 11 1 56 15 8 12 100 0 13 14
//算法5.8 建立Huffman树
#include <iostream>
using namespace std;
typedef struct{
int weight;
int parent,lchild,rchild;
}HTNode,*HuffmanTree;
void Select(HuffmanTree &HT, int n, int &s1, int &s2)
{
int minum=1; // 定义一个临时变量保存最小值?
for(int i=1; i<=n; i++) // 以下是找到第一个最小值
{
if(HT[i].parent == 0)
{
minum = i;
break;
}
}
for(int i=1; i<=n; i++)//每一个跟最小的比
{
if(HT[i].parent == 0)
if(HT[i].weight < HT[minum].weight)
minum = i;
}
s1 = minum;
// 以下是找到第二个最小值,且与第一个不同
for(int i=1; i<=n; i++)
{
if(HT[i].parent == 0 && i != s1)
{
minum = i;
break;
}
}
for(int i=1; i<=n; i++)
{
if(HT[i].parent == 0 && i != s1)
if(HT[i].weight < HT[minum].weight)
minum = i;
}
s2 = minum;
}
void CreateHuffmanTree(HuffmanTree &HT,int n)
{
if(n<=1) return ;
int m=2*n-1;
HT =new HTNode[m+1];
for (int i=1;i<=m;++i)
{
HT[i].lchild=0;
HT[i].rchild=0;
HT[i].parent=0;
}
for(int i=1;i<=n;++i)
cin>>HT[i].weight;
//
for(int i=n+1;i<=m;++i)
{
int s1,s2;
Select(HT,i-1,s1,s2);
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;
}
for(int i=1;i<=m;++i)
{
cout<<HT[i].weight<<' '<<HT[i].parent<<' '<<HT[i].lchild<<' '<<HT[i].rchild<<endl;
}
}
int main(int argc, const char * argv[]) {
HuffmanTree HT;
int n;
//cout<<"input the number of node:"<<endl;
cin>>n;
CreateHuffmanTree(HT,n); //在此函数中输入各权值,输出Huffman树:按构造的顺序显示内结点,父结点 ,其左子女,右子女,各数据间空一空格
return 0;
}