用两个栈实现队列

题目:用两个栈实现一个队列。队列声明如下，请实现它的两个函数 appendTail 和deleteHead, 分别完成在队列尾部插入结点和在队列头部删除结点的功能。


template <typename T> 
class CQueue
{
public:
CQueue(void);
~CQueue(void);
void appendTail(const T & node);
T deleteHead();


private:
stack<T> stack1;
stack<T> stack2;
};

#include <iostream>
#include <stack>
using namespace std;


template <typename T>
class CQueue
{
private:
	stack<T> stack1;
	stack<T> stack2;


public:
	CQueue(void){}
	~CQueue(void){}

	void appendTail(const T & element)
	{
		stack1.push(element);
	}


	T deleteHead()
	{
		if (isEmpty())
			return NULL;

		T element;
		while (!stack1.empty())
		{
			node = stack1.top();
			stack2.push(element);
			stack1.pop();
		}

		element = stack2.top();
		stack2.pop();
		return node;
	}

	void deleteAndPrintQueue()
	{
		while (!isEmpty())
			cout << deleteHead() << " ";

		cout << endl;
	}


	bool isEmpty()
	{
		return stack1.empty() && stack2.empty();
	}
};




void Test(char actual, char expected)
{
	if (actual == expected)
		printf("Test passed.\n");
	else
		printf("Test failed.\n");
}


int main()
{ 
	CQueue<char> queue;


	queue.appendTail('a');
	queue.appendTail('b');
	queue.appendTail('c');


	char head = queue.deleteHead();
	Test(head, 'a');


	head = queue.deleteHead();
	Test(head, 'b');


	queue.appendTail('d');
	head = queue.deleteHead();
	Test(head, 'c');


	queue.appendTail('e');
	head = queue.deleteHead();
	Test(head, 'd');


	head = queue.deleteHead();
	Test(head, 'e');
	return 0;
}