Queues and Stacks

Question

Illustrate Queues and Stacks?

Answer 1

Stacks denote a list in which all items are accessed and processed on basis of Last-In-First-Out (LIFO). In a stack, elements are inserted (push operation) and deleted (pop operation) from the same end known as top.

Queues denote a list in which insertion and deletion of an item is done on the basis of First-In-First-Out (FIFO). Items in a queue are inserted from one end, known as the rear end, and are deleted from the other end, known as the front end of the queue.