STACKS AND QUEUE IN DSA

A stack is a container of objects that are inserted and removed according to the last-in-first-out (LIFO) principle. In the pushdown stacks only two operations are allowed: push the item into the stack, and pop the item out of the stack. A stack is a limited access data structure - elements can be added and removed from the stack only at the top. push adds an item to the top of the stack, pop removes the item from the top. A helpful analogy is to think of a stack of books; you can remove only the top book, also you can add a new book on the top.

A queue is a container of objects (a linear collection) that are inserted and removed according to the first-in-first-out (FIFO) principle. An excellent example of a queue is a line of students in the food court of the UC. New additions to a line are made to the back of the queue, while removal (or serving) happens in the front. In the queue, only two operations are allowed en queue and de queue. Enqueue means to insert an item into the back of the queue, dequeue means removing the front item. The picture demonstrates the FIFO access.

The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.

Name of the Speaker: Jwala Chorasiya

About the Speaker: Intern/Educator at CodeChef | 4⭐ @CodeChef | MERN STACK| University Leader at Community Classroom

In this session, the speaker will take you through the journey inside out of stack and queue.

For more insights, attend the event and join the community!!

Support the community: commudle.com/communities/cdn-data-structures-and-algorithms