哈夫曼编码与树结构.cpp

哈夫曼编码与树结构的东西啊

#include <stdio.h>
#include <stdlib.h>
#include <iostream.h>
#include <string.h>
#define MaxSize 50
typedef struct{
    char c;                   
    int w;                       
    char code[MaxSize];          
    }HuffCode[MaxSize];
typedef struct{
    int Weight;                
    int LChild,RChild,Parent;
    }HTNode,HuffTree[MaxSize];
//================================================================================
void HuffmanTree(HuffTree HT,int length,HuffCode hc);        
void SelectHTNode(HuffTree HT,int n,int *min1,int *min2);    
void HuffmanCode(HuffTree HT,int len,HuffCode hc);        
//================================================================================
int main()
{
    HuffTree HT;       
    HuffCode HC;       
    int i,len;
    printf("哈夫曼编码与树结构\n\n请输入字符数量：");
	scanf("%d",&len); 
	printf("您输入的字符数量为：%2d",len);
    printf("个\n\n请输入字符及权值(e.g.:  \"a16[回车]\" )：\n");
    for(i=1;i <= len;i++)
    {
        while(getchar() != '\n')    NULL;
        printf("No.%2d：  ",i);
        HC[i].c = getchar();
        scanf("%d",&HC[i].w);
    }
    HuffmanTree(HT,len,HC);
    HuffmanCode(HT,len,HC);
    printf("\nHuffman编码为：\n");
    for(i = 1;i<=len;i++)
    {
        printf("\n %c :",HC[i].c);
        puts(HC[i].code);
    }

    printf("\n\nHuffman树结构为：");
    printf("\nHT[i]:\t权值\t双亲\t左孩子\t右孩子\n");
    for(i = 1;i<2*len;i++)
    {
        if(i <= len)    printf("(%c)",HC[i].c);
        printf("%2d:\t %2d;\t%2d,\t %2d,\t %2d.\n",\
            i,HT[i].Weight,HT[i].Parent,HT[i].LChild,HT[i].RChild);
    }
    return 0;
}
//================================================================================
void HuffmanTree(HuffTree HT,int length,HuffCode hc)//哈夫曼树
{
    int i,min1,min2;
    HT[0].Weight = 65535;
    for(i = 1;i <= length;i++)//对数组前n个初始化
    {
        HT[i].Weight = hc[i].w;
        HT[i].LChild = HT[i].RChild = HT[i].Parent = -1;
    }
    for(;i < 2*length;i++)//对数组n～2*n-1个初始化
    {
        HT[i].LChild = HT[i].RChild = HT[i].Parent = -1;
    }

    for(i = length+1;i < 2*length;i++)//建立哈夫曼树
    {
        SelectHTNode(HT,i,&min1,&min2);
        HT[min1].Parent = i;
        HT[min2].Parent = i;
        HT[i].LChild = min1;
        HT[i].RChild = min2;
        HT[i].Weight = HT[min1].Weight + HT[min2].Weight;
    }
}
//================================================================================
void SelectHTNode(HuffTree HT,int n,int *min1,int *min2)//找最小的两个节点    
{
    int i;
    *min1 = *min2 = 0;
    for(i = 1;i < n;i++)
    {
        if(HT[i].Parent == -1)
        {
            if(HT[*min1].Weight >= HT[i].Weight)
            {
                *min2 = *min1;
                *min1 = i;
            }
            else if(HT[*min2].Weight > HT[i].Weight)    *min2 = i;
        }
    }
}
//================================================================================
void HuffmanCode(HuffTree HT,int len,HuffCode hc)//哈夫曼编码        
{
    int i,j,tc,Stack[MaxSize],top = -1;
    char flag[MaxSize];
    HTNode th;
    for(i = 1;i <= len;i++)
    {
        top = -1;                        
        j = 0;                            
        th = HT[i];                        
        tc = i;                            
        while(th.Parent != -1)
        {            
            Stack[++top] = th.Parent;
            if(HT[th.Parent].LChild == tc)    {flag[top] = 'L'; tc = th.Parent;}
            if(HT[th.Parent].RChild == tc)    {flag[top] = 'R'; tc = th.Parent;}
            th = HT[Stack[top]];        
        }                              
        while(top != -1)
        {
            if(flag[top] == 'L')    hc[i].code[j++] ='0';
            else                    hc[i].code[j++] ='1';
            Stack[top--];               
        }
        hc[i].code[j] ='\0';       
	}
}