Implementing Queue using Linked list

A queue (First in First out) is an ordered collection of items where the addition of new items happens at one end, called the rear, and removal of existing items occurs at the other end called front. It can be implemented using Linked Lists which brings many advantages over array implementation

Read this article to learn about Implementing Queue using Linked list in depth

Have a doubt or thought? Join the discussion now

This is a companion discussion topic for the original entry at