C语言实现Huffman树并计算带权路径长度

More Code,More progress

#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef struct _BTreeNode 
{
    ElemType data;
    struct _BTreeNode* left;
    struct _BTreeNode* right;
}BTreeNode;



//根据数组 a 中 n 个权值建立一棵哈夫曼树，返回树根指针
BTreeNode* CreateHuffman(ElemType a[], int n)
{
    int i, j;
    BTreeNode **b, *q;
    b = (BTreeNode **)malloc(n*sizeof(BTreeNode));
    for (i = 0; i < n; i++) //初始化b指针数组，使每个指针元素指向a数组中对应的元素结点
    {
        b[i] =(BTreeNode *) malloc(sizeof(BTreeNode));
        b[i]->data = a[i];
        b[i]->left = b[i]->right = NULL;
    }
    for (i = 1; i < n; i++)//进行 n-1 次循环建立哈夫曼树
    {
        //k1表示森林中具有最小权值的树根结点的下标，k2为次最小的下标
        int k1 = -1, k2;
        for (j = 0; j < n; j++)//让k1初始指向森林中第一棵