huffmancodes.cpp

来自「Huffman codes 1.In telecommunication, h」· C++ 代码 · 共 26 行

#include<iostream>
#include<stdlib.h>

using namespace std;

struct CODE{
    char word;
    int huffman, freq, length;
    int left, right;
};

CODE reg[19]; 

void tree(CODE &root, int huffman, int length){
    if(root.left==100){ 
        root.huffman=huffman;
        root.length=length;
    }else{
        tree(reg[root.left], (huffman*2), (length+1));
        tree(reg[root.right], (huffman*2+1), (length+1));
    }
}

int main()
{
    int num, denum;    /* 纗