Entering (push) and deleting (pop) from a stack is only can be done from one end I. E from the top of the stack I. E lifo(last in first out) mechanism where as in a queue an element is entered from front end and deleted from the rear end I. E fifo mechanism (first in first out)