huffmantree.cpp

传统Huffman的具体算法

#include <iostream.h>
#include "HuffmanTree.h"
struct Node
{
	int weight;//权值
	char word;
	char code[20];
}test[3];
void main(){

	//int weight[] = {6,2,3,4};       //权值
	test[0].weight=5;test[0].word='a';
	test[1].weight=30;test[1].word='b';
	test[2].weight=1;test[2].word='c';
	HuffmanTree<Node> a(test,4);
	//HuffmanTree<int> a(weight,4);    //图5.19 Huffman树
//	HuffmanTree<Node> a(test,4);
	cout<< "HuffmanTree is constructed. " << endl;

	cout<< "中序周游： " << endl;
	//a.InOrder(a.GetRoot());        //中序周游
}