数据结构——栈的操作

 1 template<typename T>class CQueue
 2 {
 3 public:
 4     CQueue(void);
 5     ~CQueue(void);
 6     void appendTail(const T& node);
 7     T deleteHead();
 8 private:
 9     stack<T>stack1 ;
10     stack<T>stack2;
11 };
12 template<typename T>
13 void CQueue<T>::appendTail(const T& node)
14 {
15     stack1.push(node);
16 }
17 template<typename T>
18 T CQueue<T>::deleteHead()
19 {
20     if (stack2.size()<=0)
21     {
22         while (stack1.size()>0)
23         {
24             T tmp = stack1.top();
25             stack2.push(tmp);
26             stack1.pop();
27         }
28     }
29     if (stack2.size()==0)
30     {
31         throw std::exception("Empty Queue.");
32     }
33     T head = stack2.top();
34     stack2.pop();
35     return head;
36 }