题目:用两个栈实现一个队列。队列的声明如下,请实现它的两个函数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;
};
template <typename T> void CQueue<T>::appendTail( const T & node )
{
stack1.push( node );
}
template <typename T> T CQueue<T>::deleteHead()
{
if( stack2.empty() )
{
while( !stack1.empty() )
{
T & data = stack1.top();
stack2.push( data );
stack1.pop();
}
}
if( stack2.empty() )
throw exception(" queue is empty ");
T ret = stack2.top();
stack2.pop();
return ret;
}