哈夫曼编码和译码系统.docVIP

//Queen.h #includeiostream using namespace std; template class T class Queue {public: Queue(int size) { maxsize=size; q=new T[maxsize]; front=rear=0; } virtual bool IsEmpty()const {return front==rear; } bool Front(T x) { if(IsEmpty()) return false; x=q[(front+1)%maxsize]; return true; } virtual bool IsFull()const {return (rear+1)%maxsize==front; } virtual bool EnQueue(T x) { if(IsFull()) return false; q[(rear=(rear+1)%maxsize)]=x; return true; } bool DeQueue() { int a; if(IsEmpty()) return false; a=front; front=(front+1)%maxsize; return true; } void Clear(){ front=