Skip to main content

Introduction to Linked Lists III

In the article Introduction to Linked Lists, we introduced the concept of linked list, the example program was programmed to be able to add and display the elements in the linked list. In reality only addition of elements to the linked list is not enough to take the most out of linked list; we should be able to do other operations such as insertion, deletion of elements etc.

This article would teach you to do such operation (insertion, addition, deletion etc).

The program itself is quite big and has enough comments so I won’t discuss anything here; rather I leave it up to you to understand all the operations yourself!

  // -- Linked Lists --
  // ------------------
  // Example program to illustrate
  // addition, insertion, deletion
  // and display of nodes in the 
  // linked list

  #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 insert(int, int);
  void add(int);
  void display(void);
  void del(int);
  void free();

  void main(void)
  {
   int ch,pos,num;

   while(ch!=5)
   {
    cout<<"1> Add";
    cout<<"\n2> Insert";
    cout<<"\n3> Delete";
    cout<<"\n4> Display";
    cout<<"\n5> Quit\n";

    cin>>ch;

    switch(ch)
    {
     case 1:
      cout<<"enter element:";
      cin>>num;
 
      add(num);
      break;

     case 2:
      cout<<"enter pos:";
      cin>>pos;
      cout<<"enter element:";
      cin>>num;
      insert(pos,num);
      break;

     case 3:
      cout<<"enter element to be deleted:";
      cin>>num;
      del(num);
      break;

     case 4:
      display();
      break;
    }
   }

   // free-up the allocated
   // memory
   free();
  }

  // --FUNCTION--
  // this function takes two
  // arguments, 'loc' is the 
  // number of elements after
  // which the new element having
  // value 'inf' has to be inserted
  void insert(int loc,int inf)
  {
   node *temp;
   node *temp_new;
   int i;

   // if invalid, return
if(loc<=0) return; temp=start; // skip to the desired // location where the node // is to be added for(i=1;i<loc;i++) { temp=temp->link; if(temp==NULL) { cout<<"NOT POSSIBLE!"; return; }
} // allocate new node temp_new=new node; temp_new->info=inf; // make it point to the // respective node temp_new->link=temp->link; // make the prev. node where // the new node is added, to // point at the new node temp->link=temp_new; }
  // --FUNCTION--
  // display all the data
  // in the linked list
  void display(void)
  {
   node *temp;
   temp=start;

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

  // --FUNCTION--
  // adds node to the end
  // of the linked list
  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;
   }
  }

  // --FUNCTION--
  // takes the argument of the
  // 'info' part of the node 
  // to be deleted
  void del(int inf)
  {
   node *temp, *old;

   temp=start;

   // while list not empty
   while(temp!=NULL)
   {
    // if match is found
    if(temp->info==inf)
    {
     // if it is the
     // first node
     if(temp==start)
       start=temp->link;

     else
       old->link=temp->link;

     delete temp;
     return;
    }
    else
    {
     // traverse through
     // each node
     old=temp;
     temp=temp->link;
    }
   }
  }  

  // --FUNCTION--
  // free up the allocated memory
  // used by the nodes of the
  // linked list
  void free()
  {
   // 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;
   }
  }

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