Question

What are differences between stack and queue data structure?

Answer 1

Stack	Queue
Stack is a linear data structure where data is added and removed from the top.	Queue is a linear data structure where data is ended at the rear end and removed from the front.
Stack is based on LIFO(Last In First Out) principle	Queue is based on FIFO(First In First Out) principle
Insertion operation in Stack is known as push.	Insertion operation in Queue is known as eneque.
Delete operation in Stack is known as pop.	Delete operation in Queue is known as dequeue.
Only one pointer is available for both addition and deletion: top()	Two pointers are available for addition and deletion: front() and rear()
Used in solving recursion problems	Used in solving sequential processing problems