huffman构建和代码生成

#include "string.h"
#include "conio.h"
#include <stdio.h>
#include "malloc.h"
typedef struct{
  unsigned int weight;
  unsigned int parent,lchild,rchild;
 }HTNode,*HuffmanTree;  /*树中结点的结构*/
typedef char **HuffmanCode;
void Select(HTNode ht[],int k,int *s1,int *s2){
/*ht[1…k]中选择parent为，并且weight最小的两个结点
其序号由指针变量s1,s2指向*/
  int i;
  for (i=1;i<=k && ht[i].parent!=0 ;i++);
  *s1=i;
  for (i=1;i<=k;i++)
    if (ht[i].parent==0 && ht[i].weight<ht[*s1].weight) *s1=i;
  for (i=1; i<=k ; i++)
    if (ht[i].parent==0 && i!=*s1) break;
  *s2=i;
  for (i=1;i<=k;i++)
    if ( ht[i].parent==0 && i!=*s1 && ht[i].weight<ht[*s2].weight) *s2=i;
}

void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n)
{
    if(n<=1) return;
    int m=2*n-1,i,s1,s2;
    HuffmanTree p;
    HT=(HuffmanTree) malloc((m+1)*sizeof(HTNode));
    for(p=HT+1,i=1;i<=n;++i,++p,++w)
    {
      p->weight=*w;
      p->parent=0;
      p->rchild=0;
      p->lchild=0;
    }
       // *p={*w,0,0,0};
    for(;i<=m;++i,++p)
    {
      
      p->weight=0;
      p->parent=0;
      p->rchild=0;
      p->lchild=0;
    }
       // *p={0,0,0,0};
    for(i=n+1;i<=m;++i)
    {
     
        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;
   
    }

 

//
    HC=(HuffmanCode) malloc((n+1)*sizeof(char *));
    char *cd=(char *)malloc(n*sizeof(char));
    cd[n-1]='/0';
    for(i=1;i<=n;++i)
    {
         int start=n-1;
         for(int c=i,int f=HT[i].parent;f!=0;c=f,f=HT[f].parent)
    if(HT[f].lchild==c)  cd[--start]='0';
    else
      cd[--start]='1';
    HC[i]=(char *)malloc((n-start)*sizeof(char));
    strcpy(HC[i],&cd[start]);
    }
    free(cd);
}
void main()
{
   HuffmanTree ht;//huffman Tree
   HuffmanCode hc;//huffman code
   int w[]={10,20,30,40,50};//权值可以自己修改
   int n=5;//权值的个数
   HuffmanCoding(ht,hc,w,n);
    for(int i=1;i<=n;++i)
  printf("%s/n",hc[i]);

}