linkedqueue.h

包括树的构造

#include "Node.h"
template<class T>
class LinkedQueue
{
public:
	LinkedQueue(){front=rear=0;}
	~LinkedQueue();
	bool IsEmpty()const{return ((front)?false:true);}
	bool IsFull()const;
	T First()const;
	T Last()const;
	LinkedQueue<T>&Add(const T&x);
	LinkedQueue<T>&Delete(T&x);
protected:
private:
	LNode<T>*front;
	LNode<T>*rear;
};
template<class T>
LinkedQueue<T>::~LinkedQueue()
{
	LNode<T> *next;
	while (front)
	{
		next=front->link;
		delete front;
		front=next;
	}
}
template<class T>
bool LinkedQueue<T>::IsFull()const
{
	LNode<T>*p;
	try
	{
		p=new LNode<T>;
		delete p;
		return false;
	}
	catch (NoMem)
	{
		return false;
	}
}
template<class T>
T LinkedQueue<T>::First()const
{
	if (IsEmpty())throw OutOfBounds();
	return front->data;
}
template<class T>
T LinkedQueue<T>::Last()const
{
	if (IsEmpty())throw OutOfBounds();
	return rear->data;
}
template<class T>
LinkedQueue<T>&LinkedQueue<T>::Add(const T&x)
{
	LNode<T>*p=new LNode<T>;
	p->data=x;
	p->link=0;
	if (front)rear->link=p;
	else front=p;
	rear=p;
	return *this;
}
template<class T>
LinkedQueue<T>&LinkedQueue<T>::Delete(T&x)
{
	if (IsEmpty())throw OutOfBounds();
	x=front->data;
	LNode<T> *p=front;
	front=front->link;
	delete p;
	return *this;
}