queue.h

树跟二叉树完整试用版 请选择:(1)建立二叉树:(2)建立二树:(3)帮助:(4)退出:

template<typename T>class queue;

template<typename T>class queueNode
{
private:
	
	queueNode<T> *next;

    T element;

public:

	queueNode(T data){ element=data; next=NULL;}

	friend class queue<T>;
};

template<typename T>class queue
{
public:

	queue(){rear=front=NULL;}

	~queue();

	void MakeEmpty();

	void EnQue(T data);

	T DeQue();

	T GetFront();

	bool IsEmpty(){return front==NULL;}

private:

	queueNode<T> *rear,*front;
};

template<typename T>queue<T>::~queue()
{
	MakeEmpty();
}

template<typename T>void queue<T>::MakeEmpty()
{
	queueNode<T> *temp;

	while(front)
	{
		temp=front;

		front=front->next;

		delete temp;
	}
}

template<typename T>void queue<T>::EnQue(T data)
{
	queueNode<T> *current;

	current=new queueNode<T>(data);
	
	if(front==NULL)

	front=rear=current;

	else {

	      rear->next=current;

		  rear=current;
	}
}

template<typename T>T queue<T>::DeQue()
{
	assert(!IsEmpty());
	
	queueNode<T> *temp;

	T data;

	temp=front;

	data=temp->element;

	front=front->next;

	delete temp;

	return data;
}

template<typename T>T queue<T>::GetFront()
{
	assert(!IsEmpty());
	
    return front->element;
}