典型数据结构--基于链表的队列实现

#include <iostream>

using namespace std;

template<typename T>
struct Node{
	T m_nData;
	Node* m_pNext;
	Node(T data);
};
template<typename T>
Node<T>::Node(T data):
	m_nData(data),m_pNext(NULL) {}


template<typename T>
class CQueue{
private:
	 Node<T>* m_pFront;
	 Node<T>* m_pRear;
public:
	 CQueue();
	 ~CQueue();
	 bool mIsEmpty() const;
	 bool mIsFull() const;
	 T mFirst() const;
	 T mLast() const;
	 CQueue<T>& mAdd(const T&);
	 CQueue<T>& mDelete();
};

template<typename T>
CQueue<T>::CQueue(){
	m_pFront = m_pRear = NULL;
}

template<typename T>
CQueue<T>::~CQueue(){
	Node<T>* pTmpNode;
	while(m_pFront){
		pTmpNode = m_pFront->m_pNext;
		delete m_pFront;
		m_pFront = pTmpNode;
	}
}

template<typename T>
bool CQueue<T>::mIsEmpty() const{
	return (m_pFront==NULL) ? true : false;
}

template<typename T>
T CQueue<T>::mFirst() const{
	if(!mIsEmpty())
		return m_pFront->m_nData;
}
template<typename T>
T CQueue<T>::mLast() const{
    if(!mIsEmpty())
		return m_pRear->m_nData;
}
template<typename T>
bool CQueue<T>::mIsFull() const{
	Node<T>* pNode = new Node<T>;
	if(pNode){
		delete pNode;
		return true;
	}
	return false;
}
template<typename T>
CQueue<T>& CQueue<T>::mAdd(const T& data){
	Node<T>* pNode = new Node<T>(data);
    if(m_pFront)
		m_pRear->m_pNext = pNode;
	else
		m_pFront = pNode;
	m_pRear = pNode;
	return *this;
}
template<typename T>
CQueue<T>& CQueue<T>::mDelete(){
	if(m_pFront){
		Node<T>* p = m_pFront->m_pNext;
		delete m_pFront;
		m_pFront = p;
	}
	return *this;
} 

int main(){
	CQueue<int> queue;
	for(int i = 0;i < 50; i ++){
		queue.mAdd(i);
		cout << queue.mLast() << endl;
	}
	system("pause");
	return 0;
}
    

队列和栈是最为经典的两个数据结构，实现方式以线性表(数组)或者链表形式较为多见。