❗️All the code snippets you will see below are just Pseudo code. If you want to see working code — click here

Prerequisites

Before proceeding further, make sure you have gone through both of these posts first because I am using Linked Lists to implement Stack and Queue rather than Arrays.

Why to use Linked Lists while implementing Stacks and Queues ?

I found some lines over this —

…because linked lists store data elements in linear sequences, they can be used to give alternative implementations of stacks and queues. One advantage to using linked lists is that we don’t have to worry about filling up something like an array — we can just keep allocating cells as long as we need to (unless we run out of memory). Implementing a stack using a linked list is particularly easy because all accesses to a stack are at the top. One end of a linked list, the beginning, is always directly accessible. We should therefore arrange the elements so that the top element of the stack is at the beginning of the linked list, and the bottom element of the stack is at the end of the linked list. We can represent an empty stack with null…

another reason is that you will able to practice linked-lists while implementing stacks and queues which will give you the understanding of how Stacks and Queues works while making you strong with linked-lists.

read full article over here..

Lets’ begin!!