哈夫曼树建立与求最短带权路径长度

#include<stdio.h>
#include<stdlib.h>
#define n 7                      //假设有七个节点元素
struct Element
{
    int flag;
    int weight;
    int lchild,rchild,parent;                                   //每个节点均为五元组形式
}huffman[2*n-1];
int min(struct Element huffman[],int k)
{
    int i,p=k-1;
    int min=huffman[k-1].weight;
    for(i=k-2;i>=0;i--)
    {
        if(huffman[i].flag==0)
        {
            if(huffman[i].weight<min)
            {
                p=i;
                min=huffman[i].weight;
            }
        }
        else
            continue;
    }
    return p;
}
int min2(struct Element huffman[],int a,int k)
{
    int i,p,q;
    for(i=k-1;i>=0;i--)
    {