c3.h

扬辉三角的打印

#include<iostream.h>
#include<assert.h>
template<class Type>class Queue;
template<class Type>class QueueNode
{
	friend class Queue<Type>;
	private:
		Type data;
		QueueNode<Type>*link;
		QueueNode(Type d=0,QueueNode*l=NULL):data(d),link(l){}
};
template <class Type>class Queue
{
	public:
		Queue():rear(NULL),front(NULL){}
//		~Queue();
		void EnQueue(const Type&item);
		Type DeQueue();
		void MakeEmpty()
		{front=rear=NULL;}
		int IsEmpty()
			const{return front==NULL;}
	private:
		QueueNode<Type> *front,*rear;
};
template<class Type>void Queue<Type>::EnQueue(const Type&item)
{
	if(front==NULL)
		front=rear=new QueueNode<Type>(item,NULL);
	else rear=rear->link=new QueueNode<Type>(item,NULL);
}
template<class Type>Type Queue<Type>::DeQueue()
{
	assert(!IsEmpty());
	QueueNode<Type>*p=front;
	Type retvalue=p->data;
	front=front->link;
	delete p;
	return retvalue;
}