Skip to main content

Introduction to Linked Queues

In one of the article Introduction to Linked Stacks, I said that representing data structures such as Stacks and Queues as arrays had one major problem that it can’t have more than a predefined number of elements. To overcome this we used linked lists to represent stacks. In this article we’ll use linked lists to represent queues.

Below are some graphics that illustrate the addition and retrieval of elements to and from the linked queue.

Addition of elements in the linked queue

FIG.: Addition of data to the linked queue

FIG.: Retrieval of elements from the linked queue

I don’t think there is anything more that needs to be discussed, so let’s have a look at the example program:

  // -- Linked Queues --
  // C++ Example Program to
  // illustrate the representation
  // of queues as linked lists

  // node class, this will
  // represent the nodes or elements
  // of the linked queues
  class node
     int info;
     node *link;

  // declare global objects
  node *front=NULL;
  node *rear=NULL;

  // function prototypes
  void add(int);
  int retrieve();
  void free();

  void main(void)
   int ch=0,num;

    cout<<"1> Add";
    cout<<"\n2> Retrieve";
    cout<<"\n3> Quit\n";


     case 1:
       cout<<"enter element:";


     case 2:
       cout<<"\n\Retrieved: ";

   // free up the memory

  // function to add new nodes
  // to the linked queue
  void add(int inf)
   node *temp;

   temp=new node;




  // function to retrieve
  // data from the linked
  // queue
  int retrieve()
   node *temp;
   int inf;

    cout<<"Queue Empty!\n";
    return NULL;


   delete temp;
   return inf;

  // free the dynamic memory
  // allocated in the form of
  // nodes of the linked queue
  void free(void)
   // below is a bit confusing
   // part.
   // here all the nodes that
   // we have allocated are
   // being freed up
   node temp;
    // store the next node
    // to the one being deleted
    // delete the node
    delete front;

    // retrieve the next node
    // to be deleted;


Related Articles:

Popular posts from this blog

Fix For Toshiba Satellite "RTC Battery is Low" Error (with Pictures)

RTC Battery is Low Error on a Toshiba Satellite laptop "RTC Battery is Low..." An error message flashing while you try to boot your laptop is enough to panic many people. But worry not! "RTC Battery" stands for Real-Time Clock battery which almost all laptops and PCs have on their motherboard to power the clock and sometimes to also keep the CMOS settings from getting erased while the system is switched off.  It is not uncommon for these batteries to last for years before requiring a replacement as the clock consumes very less power. And contrary to what some people tell you - they are not rechargeable or getting charged while your computer or laptop is running. In this article, we'll learn everything about RTC batteries and how to fix the error on your Toshiba Satellite laptop. What is an RTC Battery? RTC or CMOS batteries are small coin-shaped lithium batteries with a 3-volts output. Most laptops use

The Best Way(s) to Comment out PHP/HTML Code

PHP supports various styles of comments. Please check the following example: <?php // Single line comment code (); # Single line Comment code2 (); /* Multi Line comment code(); The code inside doesn't run */ // /* This doesn NOT start a multi-line comment block /* Multi line comment block The following line still ends the multi-line comment block //*/ The " # " comment style, though, is rarely used. Do note, in the example, that anything (even a multi-block comment /* ) after a " // " or " # " is a comment, and /* */ around any single-line comment overrides it. This information will come in handy when we learn about some neat tricks next. Comment out PHP Code Blocks Check the following code <?php //* Toggle line if ( 1 ) {      // } else {      // } //*/ //* Toggle line if ( 2 ) {      // } else {      // } //*/ Now see how easy it is to toggle a part of PHP code by just removing or adding a single " / " from th

Pong Game in HTML & JavaScript (Updated)

HTML Pong Game Gameplay Pong is one of the first games that many people from the 80s or 90s had played as children. Lots of people know it as a simple arcade game but what they probably do not know is that this simple game helped establish the video game industry! In this post, we'll be making our version of a very simple but fully working Pong game in HTML, CSS and JavaScript. Basic Game Structure Games, however simple or complex they may be, follow the basic Game Loop design as shown in the chart below. Event-oriented game engines usually encapsulate the design and provide you with an event mechanism for handling various parts like the input, update, and rendering but internally the basic design is being followed. Pong Game Loop For our Game Loop, we'll be using JavaScript setInterval so that the game code remains asynchronous and separate. As you may have guessed a while (or any other loop) will freeze the page. For our input, we'll be using onmousemove event to update t