哈夫曼树的实现

using namespace std;  
   
//********************************  
//构造哈夫曼树  
//********************************  
   
/*哈夫曼树顺序表的定义*/  
typedef struct  
{  
       intweight;  
       intparent,lchild,rchild;  
}HTNode;  
   
typedef HTNode * HuffmanTree;  
   
   
/*初始化一个哈夫曼树*/  
void InitHuffmanTree(HuffmanTree&HT,int m)  
{  
       inti;  
       HT=newHTNode[m];  
       for(i=0;i<m;i++)  
       {  
              HT[i].weight=0;  
              HT[i].parent=-1;  
              HT[i].lchild=-1;  
              HT[i].rchild=-1;  
       }  
}  
//****************************************  

//从n个结点中选取最小的两个结点  
//****************************************  
void SelectMin(HuffmanTree &HT,intn,int &min1,int &min2)  
{  
       typedefstruct  
       {  
              intNewWeight;//存储权  
              intp;//存储该结点所在的位置  
       }TempNode,*TempTree;  
   
       TempTreeTT=new TempNode[n];  
   
       inti,j;  
   
       j=0;  
       for(i=0;i<n;i++)  
       {  
              if(HT[i].parent==-1&& HT[i].weight!=0)  
              {  
                     TT[j].NewWeight=HT[i].weight;  
                     TT[j].p=i;  
                     j++;  
              }  
       }//将HT中没有双亲的结点存储到TT中  
   
       intm1,m2;  
       m1=m2=0;  
       for(i=0;i<j;i++)  
       {  
              if(TT[i].NewWeight<TT[m1].NewWeight)//此处不让取到相等，是因为结点中有相同权值的时候，m1取最前的