两个队列实现一个栈的功能

#include <iostream>
#include <queue>
#include <exception>
using namespace std;


template<typename T> class CStack{
public:
CStack();
~CStack();
void cpush(const T& val);
T cpop();//pop的时候有返回值，这个是为了测试而是用的
private:
queue<T> que1;
queue<T> que2;


};


template<typename T> CStack<T>::CStack(){}
template<typename T> CStack<T>::~CStack(){}


template<typename T> void CStack<T>::cpush(const T& val){
if(que1.empty()){
que2.push(val);
}else{
que1.push(val);
}
}


template<typename T> T CStack<T>::cpop(){
if(que1.empty()&que2.empty()){
throw new exception("stack is empty");
}
T temp;
if(que1.empty()){
while(que2.size()>1){
temp=que2.front();
que1.push(temp);
que2.pop();
}
temp=que2.front();
que2.pop();
}else{
if(que2.empty()){
while(que1.size()>1){
temp=que1.front();
que2.push(temp);
que1.pop();
}
temp=que1.front();
que1.pop();
}
}
return temp;
}


int main(){


CStack<int> st;
st.cpush(1);
st.cpush(2);
st.cpush(3);
cout<<st.cpop()<<endl;
cout<<st.cpop()<<endl;
st.cpush(5);
cout<<st.cpop()<<endl;
cout<<st.cpop()<<endl;






return 0;
}