Skip to main content

Introduction to Linked Stacks

In the article Data Structures: Introduction to Stacks, we saw that there was one major disadvantage of representing stacks using arrays- the stack like the array could have a limited number of elements, while stacks should be able to grow up to any number of elements. Besides this there were other disadvantages too.

In one of the other article about Linked Lists, we noticed one useful property of linked lists that they can grow up to any size to accommodate for the addition of elements and it efficiently uses the memory too.

So if we combine both of this to from a linked version of the stack then it won’t have the shortcomings that the array version had.

This is what this article is all about.

pushing and popping

As you know that addition of elements to the stack is known as pushing while retrieval is known as popping.

The process of pushing and popping in case of linked version of stack is slightly different from the array version. The following graphics will clear it though!

pushing of elements in the linked stack

FIG: pushing of elements in the linked stack

popping of the elements from the linked stack

FIG: popping of the elements from the linked stack

Now that you know how the basic operations are performed on linked stacks I present you with the example program to illustrate this.

As always I would strongly recommend you to read the comments!

  // -- Linked stacks --
  // Example program to 
  // illustrate basic
  // push and pop to a
  // linked stack

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

  // declare global objects
  node *start=NULL;

  // function prototypes
  void push(int);
  int pop();

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

    cout<<"1> Push";
    cout<<"\n2> Pop";
    cout<<"\n3> Quit\n";


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


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

  // 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 start;

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

  // pushes an element 'inf'
  // to the linked stack
  void push(int inf)
   node *temp1;
   node temp2;

   // if the element to be added
   // is the first element of 
   // linked stack
    // allocate a new node
    temp1=new node;

    // make start point at it
   // if not
    // store the information
    // about the node pointed
    // by 'start'>info;;

    temp1=new node;
    // insert the new node
    // at the beginning
    // and make its link
    // point to the prev.
    // node pointed by 'start'


  // returns an element from the
  // linked stack
  int pop()
   node temp;

    // store info. about
    // the first element
    // that has to be pooped

    // delete the node
    delete start;
    // make start point at the
    // next node which had been
    // stored;


   return NULL;


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