Queue using stack

#1

Please explain the Dynamic_stack concept as i didn’t get it which we have used to solve the problem of implementing queue using stack?

#2

@prateekad99,
Stack is a linear data structure in which insertion and deletion of elements takes place only one end known as TOP.

In queue using 2 stacks there are 2 approaches. First approach is by making Dequeue costly, second approach is to make the enqueue operation costly.

A dynamic stack is a stack which we create using arrays. We maintain a variable top which tracks the element at top of the array. If we push the element in stack, top changes to the element recently pushed. If we pop, the element in top is popped.