文件名称：Huffman编/译码器 实验报告
文件大小：117KB
文件格式：DOCX
更新时间：2014-03-11 09:39:36
赫夫曼树 编译码器
void main(){
//HuffmanTree T;
//HuffmanCode hc;
/*char*str[]={" ,"A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"};
int w[]={186,64,13,22,32,103,21,15,47,57,1,5,32,20,57,63,15,1,48,51,80,23,8,18,1,16,1};
for(i=1;i<=n;i++){
strcpy(T[i].data,str[i]);
T[i].weight=w[i];
}*/
Initialization();
int k;
while(1){
cout<<"编码按1："<