Skip to main content

Introduction to Linked Lists

We have been using arrays to store similar data linearly. While arrays are simple to understand and easy to implement in common situations, they do suffer from some drawbacks which are listed below:

  • Arrays have fixed dimensions, even if we dynamically allocate the dimension it remains constant throughout. So there is a limit to the number of elements it can store.

  • Operations such as insertion and deletion are pretty much difficult to implement and increases the overhead because these operations require elements in the array to be physically shifted.

Linked lists overcome these drawbacks and are commonly used to store linear data.

Actually elements of linked lists (called as nodes) store two information, data and the link (pointer) pointing to the next elements (node).

The elements (nodes) are linked sequentially with the help of link pointers. So we can say that linked lists are collection of nodes which have data and are linked sequentially so that all the nodes or elements are grouped together.

In programming sense, linked lists are classes whose general form is:

  class node
  {
   public:
     data-type info;
     node *link;
  };

Here info stores the actual data while link stores the memory address of the next node, which forms the link between the nodes.

Graphical Representation of a Node of a Linked List FIG.: Graphical representation of a node

Following figure illustrates the growing of linked lists, the node which has its link as NULL is the last element in the linked list.

Growing of linked list FIG.: Linked lists grows like this

Let us now discuss a bit about how a linked list grows:

  1. We have a pointer that stores the memory address of the first element in the linked list, represented as the start pointer (of type node). It is NULL to begin with as we don’t have any element in the list.

  2. As an element is added, the start pointer is made to point at it and since for now the first element is the last element therefore its link is made to be NULL

  3. After the addition of each element the link pointer of the previously last element is made to point at new last element. This step continues…

In this way the number of nodes in a linked list can grow or shrink over time as far as memory permits.

Below is the example program that illustrates linked lists. This program is made as simple as possible and therefore it only performs the basic action (addition of element) in the linked list.

  // -- Linked Lists --
  // ------------------
  // Example program in C++
  // to illustrate the most simple
  // linked list
  // NOTE: It is designed so that it
  // could only add nodes to the
  // list and display them.
  #include<iostream.h>

  // node class, this will
  // represent the nodes or elements
  // of the linked list
  class node
  {
   public:
     int info;
     node *link;
  };

  // declare global objects
  node *start=NULL;

  // function prototypes
  void add(int inf);
  void display(void);

  void main(void)
  {
   int ch;

   // input elements
   while(ch!=0)
   {
    cout<<"enter element to be added:";
    cout<<"\nenter 0 to stop...\n";
    cin>>ch;

    if(ch!=0) add(ch);
    cout<<"\n\n";
   }

   cout<<"elements are...\n";
   display();

   // below is a bit confusing
   // part.
   // here all the nodes that
   // we have allocated are
   // being freed up
   node temp;
   while(start!=NULL)
   {
    // store the next node
    // to the one being deleted
    temp=*start;
  
    // delete the node
    delete start;

    // retrieve the next node
    // to be deleted
    start=temp.link;
    }
   }

   void add(int inf)
   {
    node *temp1;
    node *temp2;

    // if the element to be added
    // is the first element
    if(start==NULL)
    {
    // allocate a new node
    temp1=new node;
    temp1->info=inf;
    temp1->link=NULL;

    // make start point at it
    start=temp1;
   }
   // if not
   else
   {
    temp1=start;

    // find out the last element
    while(temp1->link!=NULL)
    temp1=temp1->link;

    // allocate new node
    temp2=new node;
    temp2->info=inf;
    temp2->link=NULL;

    // make the last element
    // of the list to point
    // at the newly created node
    temp1->link=temp2;
   }
  }

  void display(void)
  {
   node *temp;
   temp=start;

   // traverse or process
   // through each element
   // and keep printing
   // the information
   while(temp!=NULL)
   {
    cout<<temp->info<<endl;
    temp=temp->link;
   }
  }

Good-Bye!

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

How to Remove Bullet Points in CSS

This will be a short guide on how to remove bullet points from ordered/unordered lists with CSS, you only need two lines of CSS for this. The first removes the actual bullet points and the second one removes the space to the left, as evident from the following video: We'll also be doing some bullet beautification in the last section if that's what you are looking to do. How to Remove Bullet Points in HTML/CSS Now that we know what CSS properties actually accomplish what we want let's see how we can implement this in our HTML code. Using Inline "style" Tag (The quick and dirty way) As the title suggests, this is the quickest way to remove bullet points in which you wouldn't have to edit any CSS files (for example, for Blogger or WordPress). This method would be useful for a one-off case - just add the following " style " attribute to the list you want to remove the bullet points from: <h1>Ordered List</h1> <ol  style="list-styl