Question: Write a c++ code to implement the following operations of a queue using 1 stack. push(x) -- Push element x to the back of queue.
Write a c++ code to implement the following operations of a queue using 1 stack.
push(x) -- Push element x to the back of queue.
pop() -- Removes the element from in front of queue.
peek() -- Get the front element.
empty() -- Return whether the queue is empty.
Put each function inside a class and use template
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
