www.pudn.com > huffman.rar > test.c
#include "ECBTree.h" #include "MyAssert.h" #include "Ulti.h" #include#include int* initList; void main() { FILE* inputFile,* outputFile; int len; int i; PHtTree myHtTree; assertF((inputFile=fopen("inputData2.txt","rb"))!=NULL,"open file error"); assertF((outputFile=fopen("outputData.txt","wb"))!=NULL,"open file error"); fscanf(inputFile,"len=%d;\r\n",&len); initList=(int*)malloc(sizeof(int)*len); for(i=0;i ",initList[i]); printf("==========="); myHtTree=haffmanAlgorithm(len,initList); preHtOrder(myHtTree,myHtTree->rootIndex); getchar(); }