C++之链队

#include <iostream>
using namespace std;

template <class T>
class LinkNode {
	template <class T>
	friend class LinkQueue;

public:
	LinkNode() {
		next = NULL;
	};
private:
	T data;
	LinkNode* next;
};

template <class T>
class LinkQueue {
public:
	LinkQueue();
	~LinkQueue();

	bool IsEmpty();
	bool Insert(const T& x);
	bool GetElem(T& x);//求队头元素
	bool Delete(T& x);
	void OutPut(ostream& out) const;

private:
	LinkNode<T>* front;
	LinkNode<T>* rear;
	int size;
};

template<class T>
LinkQueue<T>::LinkQueue()
{
	front = NULL;
	rear = NULL;
	size = 0;
}

template<class T>
LinkQueue<T>::~LinkQueue()
{
	T x;
	while (front != NULL)//队列非空则元素依次出队
		Delete(x);
}

template<class T>
bool LinkQueue<T>::IsEmpty()
{
	return size == 0;
}

template<class T>
bool LinkQueue<T>::Insert(const T& x)
{
	LinkNode<T>* p = new LinkNode<T>;
	if (p == NULL)
		return false;
	else {
		p->data = x;
		if (front == NULL) {
			rear = p;
			front = p;
		}
		else {
			rear->next = p;
			rear = p;
		}
		size++;
		return true;
	}
}

template<class T>
bool LinkQueue<T>::GetElem(T& x)
{
	if (IsEmpty())
		return false;
	else {
		x = front->data;
		return true;
	}

}

template<class T>
bool LinkQueue<T>::Delete(T& x)
{
	LinkNode<T>* p;
	if (IsEmpty())
		return false;
	else {
		p = front;
		x = front->data;
		front = front->next;
		delete p;

		size--;
		return true;
	}
}

template<class T>
void LinkQueue<T>::OutPut(ostream& out) const
{
	LinkNode<T>* p;
	p = front;
	for (int i = 0; i < size; i++) {
		out << p->data << endl;
		p = p->next;
	}
}

template<class T>
ostream& operator<<(ostream& out, const LinkQueue<T>& x) {
	x.OutPut(out);
	return out;
}


int main() {
	LinkQueue<int>* q;




	return 0;
}