queue.h

关于数据结构中二叉树的实验源代码

const int MaxQueueSize=100;
typedef //为Datatype定义合适的类型

class SeqQueue
{
   private:
	   Datatype data[MaxQueueSize];
	   int front;
	   int rear;
	   int count;
   public:
	   SeqQueue(void)
	   {front=rear=0;count=0;}
	   ~SeqQueue(void){};
	   void QInsert(const Datatype& item);
	   Datatype QDelete(void);
	   Datatype QFront(void)const;
	   int QueueEmpty(void)const
	   { return front==rear;};
	   void ClearQueue(void)
	   {front=rear=0;count=0;};
	   int GetSize(void)const
	   {return count;};
};

void SeqQueue::QInsert(const Datatype& item)
{
	if (count==MaxQueueSize)
	{ 
		cerr<<"队列已满！"<<endl;
		exit(1);
	}
	data[rear]=item;
	rear=(rear+1)%MaxQueueSize;
	count++;
}

Datatype SeqQueue::QDelete()
{
	Datatype temp;
	if (count==0)
	{
		cerr<<"队列已空！"<<endl;
		exit(1);
	}
	temp=data[front];
	front=(front+1)%MaxQueueSize;
	count--;
	return temp;
}

Datatype SeqQueue::QFront(void)const
{
	if (count==0)
	{
		cerr<<"队列已空！"<<endl;
		exit(1);
	}
	return data[front];
}