哈夫曼树编码.docVIP

哈夫曼树编码 #include string.h #include stdio.h #define MAX_NODE 1024 #define MAX_WEIGHT 4096 typedef struct HaffmanTreeNode { char ch, code[15]; int weight; int parent, lchild, rchild; } HTNode, *HaTree; typedef struct { HTNode arr[MAX_NODE]; int total; } HTree; /* 统计字符出现的频率 */ int statistic_char(char *text, HTree *t){ int i, j; int text_len = strlen(text); t-total = 0; for (i=0; itext_len; i++) { for (j=0; jt-total; j++) if (t-arr[j].ch == text[i]){ t-arr[j].weight ++; break; } if (j==t-total) { t-arr[t-total].ch = text[i]; t-arr[t-total].weight = 1; t-total ++; } } printf(char frequence\n); for (i=0; it-total; i++) printf(%c %d\n, t-arr[i].ch, t-arr[i].weight); printf(\n); return t-total; } int create_htree(HTree *t) { int i; int total_node = t-total * 2 - 1; int min1, min2; /* 权最小的两个结点 */ int min1_i, min2_i; /* 权最小结点对 应的编号 */ int leaves = t-total; for (i=0; ileaves; i++) { t-arr[i].parent = -1; t-arr[i].rchild = -1; t-arr[i].lchild = -1; } while (t-total total_node) { min1 = min2 = MAX_WEIGHT; for (i=0; it-total; i++) { /* 对每一个结点 */ if (t-arr[i].parent == -1 /* 结点没有被合并 */ t-arr[i].weight min2) { /* 结点的权比最小权小 */ if (t-arr[i].weight min1) { /* 如果它比最小的结点还小 */ min2_i = min1_i; min2 = min1; min1_i = i; min1 = t-arr[i].weight; } else { min2_i = i; min2 = t-arr[i].weight; } } } t-arr[t-total].weight = min1 + min2; t-arr[t-total].parent = -1; t-arr[t-total].lchild = min1_i; t-arr[t-total].rchild = min2_i; t-arr[min1_i].parent = t-total; t-arr[min2_i].parent = t-total; t-arr[t-total].ch = ; t-total ++; } return 0; } /* 对哈夫曼树进行编码 */ void coding(HTree *t, int head_i, char *code) { if ( head_i == -1) return; if (t-arr[head_i].lchild == -1 t-arr[head_i].rchild == -1) { strcpy(t-arr[head_i].code, code); printf(%c: %s\n, t-arr[head_i].ch, t-arr[head_i].code); } else { int len = strlen(code); strcat(code, 0); coding(t, t-arr[head_i].lchild, code); code[len] = 1; coding(t, t-arr[head_i].rchil