/* Challenge Akira is asking us to do a Queue with 2 Stacks, which is not the best Queue design but is just for practice.*/ #include template class Stack{ private: class Node{ public: Node* under=nullptr; T data; Node(T data,Node* top){ this->data=data; this->under=top; } ~Node(){} }; Node* top=nullptr; public: Stack(){} ~Stack(){ while(top!=nullptr) pop(); } void push(T data){ Node* newNode = new Node(data,top); top=newNode; } T pop(){ if(top==nullptr) throw "Empty Stack"; Node* popped=top; T data=popped->data; top=top->under; delete popped; return data; } T peek(){ if(isEmpty()) return T{}; return top->data; } bool isEmpty(){ return top==nullptr; } }; template class Queue{ private: Stack enqueueStack{}, dequeueStack{}; void transferAll(Stack& a, Stack& b){ while(!a.isEmpty()) b.push(a.pop()); } public: Queue(){} ~Queue(){} void push(T data){ transferAll(dequeueStack,enqueueStack); enqueueStack.push(data); transferAll(enqueueStack,dequeueStack); } T pop(){ if(dequeueStack.isEmpty()) throw "Empty Queue"; T data = dequeueStack.pop(); return data; } T peek(){ return dequeueStack.peek(); } }; int main() { Queueq{}; for(int i=0;i<20;i++)q.push(i*10); for(int i=0;i<10;i++)std::cout<

Queue with 2 stacks - Stack Queue