C语言利用哈夫曼树实现哈夫曼树生成和哈夫曼编码的实现

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

#define MaxSize 50
#define MAX 32767
   /* int 8位整数*/
typedef struct{
    char c;                       /* 字符;  */
    int w;                        /* 字符权值;  */
    char *code;                   /*字符的Huffman编码;  */
}HuffmanCode[MaxSize];

typedef struct{
    int weight;                   /* 权值;  */
    int lchild,rchild,parent;
}HTNode,HuffmanTree[MaxSize];

/* ================================================================================  */
void CreateHuffmanTree(HuffmanTree HT,int length,HuffmanCode hc);        /* 生成Huffman树;  */
void SelectHTNode(HuffmanTree HT,int n,int *min1,int *min2);    /* 查找最小和次小序号;  */
void HuffmanCoding1(HuffmanTree HT,int n,HuffmanCode hc);            /* 生成Huffman编码;  */

/* =======================================================