c_queue.h

搜索二叉树的实现

#include<iostream.h>
#include <assert.h>
template<class Type> class Queue
{
	public:
		Queue(int =10);
		~Queue(){delete elements;}
        void EnQueue(const Type&item);
		Type DeQueue();
		Type GetFront();
		void MakeEmpty(){front=rear=0;}
		int IsEmpty() const {return front==rear;}
		int IsFull() const {return (rear+1)%maxSize==front;}
		int Length() const {return (rear-front+maxSize)%maxSize;}
	private:
		int rear,front;
		Type*elements;
		int maxSize;
};
template<class Type> Queue<Type>:: Queue( int sz) :front(0),rear(0),maxSize(sz)
{
	elements=new Type[maxSize];
}
template<class Type> void Queue<Type>::EnQueue(const Type &item)
{
	assert(!IsFull()) ;
	{ rear = ( rear+1 ) % maxSize ; elements [ rear ] = item ; }
}
template<class Type> Type Queue<Type>::DeQueue( )
{
	assert(!IsEmpty());
	{ front = ( front + 1 ) % maxSize ; return elements [front];}
}