數(shù)據(jù)結(jié)構(gòu)實驗三哈夫曼樹實驗報告

1、1題目：哈夫曼編譯碼器一、題目要求：寫一個哈夫曼碼的編譯碼系統(tǒng)，要求能對要傳輸?shù)膱笪倪M(jìn)行編碼和解碼。構(gòu)造哈夫曼樹時，權(quán)值小的放左子樹，權(quán)值大的放右子樹，編碼時右子樹編碼為1，左子樹編碼為0.二、概要設(shè)計：數(shù)據(jù)結(jié)構(gòu)：typedefstructintbit[MAXBIT]intstartHCodeType編碼結(jié)構(gòu)體typedefstructintweightintparentintlchildintrchildvalueHNode結(jié)點結(jié)構(gòu)體

2、函數(shù)：voidDEMONHuffmanTree(HNodeHuffNode[MAXNODE]intn)作用：構(gòu)造一個哈夫曼樹，并循環(huán)構(gòu)建intmain()作用：運用已經(jīng)構(gòu)建好的哈弗曼樹，進(jìn)行節(jié)點的處理，達(dá)到成功解碼編譯三、詳細(xì)設(shè)計：哈夫曼樹的建立：voidDEMONHuffmanTree(HNodeHuffNode[MAXNODE]intn)inti=0jm1m2x1x2x初始化存放哈夫曼樹數(shù)組HuffNode[]中的結(jié)點while(i

3、n)HuffNode[i].weight=0權(quán)值3endf設(shè)置找到的兩個子結(jié)點x1、x2的父結(jié)點信息HuffNode[x1].parent=niHuffNode[x2].parent=niHuffNode[ni].weight=HuffNode[x1].weightHuffNode[x2].weightHuffNode[ni].lchild=x1HuffNode[ni].rchild=x2葉子節(jié)點的哈夫曼編碼的保存：f(j=cd.sta

4、rt1jnj)HuffCode[i].bit[j]=cd.bit[j]HuffCode[i].start=cd.start主函數(shù)展示：intmain()HNodeHuffNode[MAXNODE]HCodeTypeHuffCode[MAXLEAF]cdintijcpnk=0wen[100]zscanf(“%d“HuffmanTree(HuffNoden)f(i=0ini)cd.start=n1c=ip=HuffNode[c].paren