Queue

Stack

It follows FIFO (First In First Out) or LILO (Last In Last Out).It follows LIFO (Last In First Out) or FILO (First In Last Out).
The elements are inserted and removed from different ends.One for insertion, i.e. REAR END and one for deletion, i.e. FRONT ENDThe elements are inserted and removed at the same end i.e. TOP.
Two different pointers are used for front end and rear end.only one pointer is used. It points to the top of the stack.
Basic operations are Enqueue (Insertion) and Dequeue (Deletion).Basic operations are Push (Insertion) and Pop (Deletion).
Queue
Queue
Stack
Stack

By Arun

Leave a Reply

Your email address will not be published. Required fields are marked *