{"post":"

Stack implementation

As we have discussed earlier, Stacks are linear data structures and follow mainly two operations, Push & Pop. Addition in a stack is called Push and removal of an entity from the stack is called Pop.

Once we know the details of stack operations, we can understand its implementation in C++ as well. Let’s look at the algorithms for various operations in Stack.

Algorithm for Pushing an item in Stack

Pushing or inserting an element in a stack involves shifting of elements as the new element can be inserted at the top only. In case of the stack being Full and no new element can be inserted, the condition is called Overflow.

/* assume that stack can hold a max of N elements*/\ntop = -1\nread item /*item to be pushed */
\nIf(top == N - 1) then
\n{\nprint“ overflow!!!” /*if top is end of the array */
\n}
\nElse
\n{\ntop = top + 1 /*increment top to make new item hold top position */
\nStack[top] = item\n
\n}
\nEnd

Algorithm for Popping an item from Stack

Popping or deletion of an entity from a stack will remove the topmost element of the stack. In a case where there is no item in the stack (stack is empty) making removal of item impossible, the condition is called Underflow.

If top == -1 then\n{
\nPrint“ underflow!!!”\n\nExit from program\n
\n}
\nElse
\n{
\nPrint stack(top)\n\ntop = top + 1\n/*top is moved making the top element inaccessible which can be considered a deletion*/\n
\n}
\nEnd
\n

Program for addition and deletion in a stack

#include <iostream.h>\n#include <stdio.h>
\n#include <conio.h>
\n#include <stdlib.h>
\n#include <ctype.h>
\n#define MAX 100 //maximum length of stack
\nchar stack[MAX]; //declaring array as global variable
\nint top;
\nvoid push(char stack[], char value, int& top); //add stack
\nvoid pop(char stack[], int& top); //delete stack
\nvoid show_Stack(char stack[], int top); //show stack
\nvoid main()
\n{
\nint choice;\n\nchar value;\n\nchar option =’Y’;\n\ntop = -1; //initializing the stack\n\nclrscr();\n\ndo\n\n{\n\n    cout &lt;&lt;”\\n Main Menu”;\n\n    cout &lt;&lt;”\\n Adding in stack”;\n\n    cout &lt;&lt;”\\n Deleting from stack”;\n\n    cout &lt;&lt;”\\n Traverse the stack”;\n\n    cout &lt;&lt;”\\n Exit”;\n\n    cout &lt;&lt;”\\n\\n Enter choice”;\n\n    cin &gt;&gt; choice;\n\n    switch (choice)\n\n    {\n\n    case 1:\n\n        do\n\n        {\n\n            cout &lt;&lt;”Enter the item to be added”;\n\n            cin &gt;&gt; value;\n\n            push(stack, value, top);\n\n            cout &lt;&lt;”\\n Do you want to add more item&lt;Y / N&gt; ?”;\n\n            cin &gt;&gt; option;\n        }\n         \n\n            while (toupper(option) ==’Y’);\n\n        break;\n\n    case 2:\n\n        option =’Y’;\n\n        do\n\n        {\n\n            value = pop(stack, top);\n\n            if (val != -1)\n\n                cout &lt;&lt;”Item deleted from stack is”&lt;&lt; value;\n\n            cout &lt;&lt;”\\n Do you want to delete more items&lt;Y / N&gt; ?”;\n\n            cin &gt;&gt; option;\n\n        } while (toupper(option) ==’Y’);\n\n        break;\n\n    case 3:\n\n        show_Stack(stack, top);\n\n        break;\n\n    case 4:\n\n        exit(0);\n    }\n\n}\n\nwhile (choice != 4);\n
\n}
\n//to add item in the stack
\nvoid push(char stack[], char value, int& top)
\n{
\nIf(top == MAX)\n\n{\n\n    cout &lt;&lt;”Stack is FULL”;\n}\n\nelse\n\n{\n\n    top = top + 1;\n\n    stack[top] = value;\n}\n
\n}
\n//to delete an item from stack
\nchar pop(char stack[], int& top)
\n{
\nchar value;\n\nif (top &lt; 0)\n\n{\n\n    cout &lt;&lt;”stack is EMPTY”;\n\n    value = -1;\n}\n\nelse\n\n{\n\n    value = stack[top];\n\n    top = top - 1;\n}\n\nreturn (value);\n
\n}
\n//to show items of stack
\nvoid show_Stack(char stack[], int top)
\n{
\nint i;\n\ni = top;\n\nclrscr();\n\ncout &lt;&lt;”items of stack are”;\n\ndo\n\n{\n\n    cout &lt;&lt;”\\n”&lt;&lt; stack[i];\n\n    i = i - 1;\n\n}\n\nwhile (i &gt;= 0);\n
\n}

\n","title":"Stack implementation using C++","authorDetails":{"name":"Sonal Moga","slug":"sonal-moga"},"description":"Stacks are linear data structures and follow mainly two operations, Push & Pop. Let’s look at the algorithms for various operations in Stack.","slug":"data-structure/stack-implementation/","articleId":"636a83447bb1ce5072622b87","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}