0001 HuffForest* initForest ( unsigned int* freq ) { //根据频率统计表，为每个字符创建一棵树
0002    HuffForest* forest = new HuffForest; //以List实现Huffman森林
0003    //HuffForest* forest = new HuffForest; //若不为测试扩容，可直接new HuffForest(0x80-0x20)
0004    for ( int i = 0; i < N_CHAR; i++ ) { //为每个字符
0005       forest->insertLast ( *( new HuffTree ) ); //生成一棵树，并将字符及其频率
0006       forest->last()->data.insert ( HuffChar ( 0x20 + i, freq[i] ) ); //存入其中
0007    }
0008    return forest;
0009 }