A stack can be compared to a bottle that is filled with stones. The only way to access the bottom stone is to remove the top stone one by one. So the stone that has gone in first is the last to come out .
Stack is a collection of objects that works in LIFO (Last in First out) mechanism while Queue is FIFO (First in First out). This means that the object that is inserted first is removed last in a stack while an object that is inserted first is removed first in a queue.
A queue can be compared to a queue at a bus stop - people board the bus in the order they arrive to the bus stop and join the queue. So the first person to join the queue is the first person to board the bus.
A Queue is a first-in, first-out data structure that pops elements in the same order than they were pushed