算法分析与设计（实验十一哈夫曼树）

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 50//叶子结点的最大值
#define M 2*N-1  //所有结点的最大值
#define inf 0x3f3f3f3f 
typedef struct
{
   
    int weight;
    int parent;
    int LChild;
    int RChild;
} HTNode,HuffmanTree[M+1];
void select(HuffmanTree ht,int n,int *s1,int *s2)  //找权值最小的两个结点
{
   
    int i;
    int minn=inf;
    int lable1=0,lable2=0;
    for(i=1;i<=n;i++)
    {
   
        if(ht[i].parent==0 && ht[i].weight<minn)
        {
   
            minn=ht[i].weight;
            lable1=i;
        }
    }
    *s1=lable1;
    minn=inf;
    for( i