哈夫曼编码解码.docxVIP

头文件：#include stdafx.h#includeiostreamusing namespace std;class HuaffmanTree;struct HuaffmanTreeNode;template class Type class MinHeap {private: Type *heapArr; //存放堆中数据元素的数组 int heapCurrentSize; //堆中当前数据元素数目 int heapMaxSize; //堆中数据元素的最大数目 void FilterDown ( int p ); //向下调整使以结点p为根的子树成堆 void FilterUp ( int p ); //向上调整使结点p所在的子树成为堆public: MinHeap ( int maxSize ); //构造函数，建立空堆 MinHeap ( Type a[], int n ); //构造函数 ~MinHeap ( ) { delete [] heapArr; } //析构函数 //~MinHeap ( ) {} //析构函数int Insert ( const Type d ); //在堆中插入元素d Type DeleteTop ( ); //删除堆顶元素 Type GetTop ( ) const //取堆顶元素值 { return heapArr[0]; } int IsEmpty ( ) const //判断堆是否为空。 { return heapCurrentSize == 0; } int IsFull ( ) const //判断堆是否为满。满堆返回1，否则返回0 { return heapCurrentSize == heapMaxSize; } int SizeofHeap ( ) const //取堆的当前元素数目 { return heapCurrentSize; } void SetEmpty ( ) { heapCurrentSize = 0; } //置堆为一个空堆};struct element{char ch;int weight;};////////////////////////////////////////const int MaxSize=20;//设定字符数目的最大值struct HuaffmanTreeNode{int data;int weight;HuaffmanTreeNode *leftchild,*rightchild,*parent;//指向左右孩子及双亲的指针};struct HuaffmanCodeNode{HuaffmanTreeNode *dataptr;//指向相应字符的指针int bit[MaxSize];//相应字符的哈夫曼编码数组int start;//哈夫曼编码的起始位置};class HuaffmanTree{public:HuaffmanTree(){};HuaffmanTree(int weight[],int n);void HuaffmanCode();//求哈夫曼编码void Huaffmandecode(int *p,int code[],int n,int i);HuaffmanTreeNode * getfhTree(){return hfTree;}HuaffmanCodeNode * getfhCode(){return hfCode;}void PreOrder ( ) { PreOrder ( hfTree ); }void InOrder ( ){ InOrder ( hfTree ); }~HuaffmanTree(){//delete [] TNode;//delete [] hfCode;//delete [] item;}protected: void PreOrder ( HuaffmanTreeNode *r ) ;//前序遍历以r为根的哈夫曼树 void InOrder ( HuaffmanTreeNode *r ); //中序遍历以r为根的哈夫曼树HuaffmanTreeNode *hfTree; //哈夫曼树的根HuaffmanCodeNode *hfCode;//哈夫曼编码HuaffmanTreeNode *TNode;int currentSize;//字符数目};class key{publ