Difference between stack and queue

Queue- FIFO

 

*First in First out 

*Consider theatre booking counter the person who enters first will get ticket and get out 

 

Stack-LIFO

 

*Last in First out

*Consider a straight box if we place a item one by one in linear. The last item will be first out.

Hi Dipa,

 

Stack and queue are that stack uses LIFO method to access and add data elements whereas Queue uses FIFO method to access and add data elements.

 

For details how to implement that please visit the below link:

 

https://www.c-sharpcorner.com/UploadFile/219d4d/queue-collection-and-stack-collection-class-in-C-Sharp/

Stack A stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. A stack follows the LIFO (Last In First Out) principle, i.e., the element inserted at the last is the first element to come out. The insertion of an element into stack is called push operation, and deletion of an element from the stack is called pop operation. In stack we always keep track of the last element present in the list with a pointer called top.

 

Queue: A queue is a linear data structure in which elements can be inserted only from one side of the list called rear, and the elements can be deleted only from the other side called the front. The queue data structure follows the FIFO (First In First Out) principle, i.e. the element inserted at first in the list, is the first element to be removed from the list. The insertion of an element in a queue is called an enqueue operation and the deletion of an element is called a dequeue operation. In queue we always maintain two pointers, one pointing to the element which was inserted at the first and still present in the list with the front pointer and the second pointer pointing to the element inserted at the last with the rear pointer.