哈夫曼编码-->输入权重，构造哈夫曼树并输出相应哈夫曼编码（c语言）

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#define SIZE 10
struct BinaryTreeNode{
    int data;
    struct BinaryTreeNode* left;
    struct BinaryTreeNode* right;
};//使用二叉树结构来存放哈夫曼树
struct BinaryTreeNode* huffmanTreeArray;
void constructHuffman();
void quickSort(int start,int end);
void binaryInsert(int start,int end,struct BinaryTreeNode* huffmanTreeTemp);
void printHuffman(struct BinaryTreeNode* huffmanTree,int huffmanstring[],int index);
int main(){
    int i,n=2*SIZE-2;
    int huffmanstring[SIZE];
    srand((int)time(NULL));
    huffmanTreeArray=(struct BinaryTreeNode*)malloc(sizeof(struct BinaryTreeNode)*(2*SIZE-1));
    for(i=0;i<SIZE;i++){
        (huffmanTreeArray+i)->data=rand()%100;
        (huffmanTreeArray+