数据结构C语言-哈夫曼树以及哈夫曼编码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int status;
typedef int ElemType;

typedef struct
{
   
    int weight;
    int parent,lchild,rchild;
}HTNode,*HuffmanTree;

void Select(HuffmanTree HT,int num,int *s1,int *s2)
{
   
    int i=1,min=1000;
    for(;i<=num;i++)
    {
   
        if(HT[i].parent==0&&HT[i].weight<min)
        {
   
            min=HT[i].weight;
            *s1=i;
        }
    }
    HT[*s1].parent=1;
    min=1000;
    for(i=1;i<=num;i++)
    {