哈夫曼树源代码

#include

#include

#include

using namespace std;

#define Max 200 eight=w[i]; HT[i].parent=0;

HT[i].lchild=0; HT[i].rchild=0;

}

for(i=n+1;i<=m;++i) eight=0; HT[i].parent=0;

HT[i].lchild=0; HT[i].rchild=0;

}

for(i=n+1;i<=m;++i) i-1]选择parent为0且weight最小的两个结点，其序号分别为S1和S2 min1=min2=INT;

for(j=1;j

if(HT[j].parent==0&&(HT[j].weight

{ min1=HT[j].weight; s1=j; }

for(j=1;j

if(HT[j].parent==0&&(HT[j].weight

{ min2=HT[j].weight; s2=j; }

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;

ch[i]='';child=s1; HT[i].rchild=s2;

cd[n-1]='\0'; arent;f!=0;c=f,f=HT[f].parent) child==c)

cd[--start]='0';

else

cd[--start]='1';

HC[i]=new char[n-start];果需要取消'\n'的影响,可以用getchar();来清除,

ch[i]=getchar(); eight<<" "<

" "<

for(i=1;i<=n;i++)eight>>HT[i].parent>>HT[i].lchild>>HT[i].rchild;

(c);

}

for(i=1;i<=n;i++)

{

(ch[i]);

fin>>HC[i];

(c);

}

}

();

}

void Encoding(HuffmanCode & HC,int n) child;

else j=HT[j].rchild;

if(HT[j].lchild==0)

{ fout<

i++;

}

fout<

}

void Print(HuffmanTree HT,int n)arent==0)eight;

for(l=m;l>0;l--)

for(i=1;i<=2*n-1;i++)

if(HT[i].weight==l)

{

for(j=0;j

{ cout<<" "; fout<<" "; }eight<

if(q==r) { k++; r=2*p; p=0; q=0; } //如果该层的结点满了，就到下一层，即k+1

}

}

int main()

{

HuffmanTree HT;

HuffmanCode HC;

char c;

int n;

HT=new HTNode[Max];

HC=new char*[Max];

for(int i=1;i<=Max;i++)//初始化

HC[i]=new char[20];

cout<<"-----------------------欢迎进入哈夫曼的编/译码系统----------------------"<

cout<<" I、初始化"<

cout<<" E、编码"<

cout<<" D、译码"<

cout<<" P、打印代码文件"<

cout<<" T、打印哈夫曼树"<

cout<<" Q、退出"<

while(c!='Q')

{

cout<<"请选择操作：";

cin>>c;

switch(c)

{

case 'I': Initialization(HT,HC,n);

cout<<"哈夫曼树成功存入文件hfmTree中！"<

break;

case 'E': Encoding(HC,n);

cout<<"对文件ToBeTran的编码结果成功存入文件CodeFile中！"<

break;

case 'D': Decoding(HT,n);

cout<<"对文件CodeFile的译码结果成功存入文件TextFile中！"<

break;

case 'P': Print(HT,n);

cout<<"毎行50个代码形式的编码结果成功写入文件CodePrin中！"<

break;

case 'T': cout<<"哈夫曼树的凹入表示法如下："<

PrintTree(HT,n);

cout<<"哈夫曼树以凹入表形式成功写入文件TreePrint中！"<

}

}

return 0; }