Now in this section, I am going to talk about Stack
Below, in the snippet i have explained all the basic operations involved with Stack.
Now, lets cover Queue. Queues are opposite of Stack. Queues work on the principle of FIFO(First in First out). Here, also two basic operations are involved to insert(known as Enqueue) and remove(known as Dequeue). Lets see the same in action.
So, this was the stacks and queue. In the next section, will cover some other collection. Till then stay tuned and Happy Coding.