Breaking News: Grepper is joining You.com. Read the official announcement!

stack implementation

Add Answer

Faithful Finch answered on August 11, 2021 Popularity 9/10 Helpfulness 1/10

answer stack implementation

related stack function

related how to implement stack

stack implementation

Comment

#include <iostream>
using namespace std;
int top = -1; //Globally defining the value of top as the stack is empty

    void push (int stack[ ] , int x , int n)
    {
        if ( top == n-1 )       //If the top position is the last of position of the stack, this means that the stack is full.
        {
            cout << "Stack is full.Overflow condition!" ;
        }
        else
        {
            top = top +1 ;            //Incrementing the top position 
            stack[ top ] = x ;       //Inserting an element on incremented position  
        }
    }
    bool isEmpty ( )
    {
        if ( top == -1 )  //Stack is empty
            return true ; 
        else
            return false;
    }
    void pop ( ) 
    {

        if( isEmpty ( ) )
        {
            cout << "Stack is empty. Underflow condition! " << endl ;
        }
        else    
        {
             top = top - 1 ; //Decrementing top’s position will detach last element from stack            
        }
    }
    int size ( )
    {
        return top + 1;
    }
    int topElement (int stack[])
    {
        return stack[ top ];
    }
    //Let's implement these functions on the stack given above 

    int main( )
    {
        int stack[ 3 ];
        // pushing element 5 in the stack .
        push(stack , 5 , 3 ) ;

        cout << "Current size of stack is " << size ( ) << endl ;

        push(stack , 10 , 3);
        push (stack , 24 , 3) ;

        cout << "Current size of stack is " << size( ) << endl ;

        //As the stack is full, further pushing will show an overflow condition.
        push(stack , 12 , 3) ;

        //Accessing the top element
        cout << "The current top element in stack is " << topElement(stack) << endl;

        //Removing all the elements from the stack
        for(int i = 0 ; i < 3;i++ )
            pop( );
        cout << "Current size of stack is " << size( ) << endl ;

        //As the stack is empty , further popping will show an underflow condition.
        pop ( );  

    }

Popularity 9/10 Helpfulness 1/10 Language cpp

Source: www.hackerearth.com

Tags: c++ implementation stack

Link to this answer
Share Copy Link

Contributed on Aug 11 2021

Faithful Finch

0 Answers Avg Quality 2/10

Closely Related Answers

stack function

Comment

function Stack() {
  let items = [];

  function push(element) {
    items.push(element);
  }

  function pop() {
    return items.pop();
  }

  function peek() {
    return items[items.length - 1];
  }

  function isEmpty() {
    return items.length === 0;
  }

  function size() {
    return items.length;
  }

  function clear() {
    items = [];
  }

  return {
    clear,
    push,
    pop,
    peek,
    isEmpty,
    size,
  };
}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.raulmelo.dev

Tags: function functio

Link to this answer
Share Copy Link

Contributed on Aug 18 2022

Pedro Mattos

0 Answers Avg Quality 2/10

how to implement stack

Comment

#include<bits/stdc++.h>
using namespace std;
int Stack[100],n,top,i;

void push(int x) {
   if(top<n-1) {
   	  top++;
      Stack[top]=x; 
   } else {
      cout<<"Could not insert data, Stack is full.\n";
   }
}

int pop() {
	int data;
   if(top>-1) {
      data = Stack[top];
      top = top - 1;   
      return data;
   } else {
      cout<<"Could not retrieve data, Stack is empty.\n";
   }
}

void display()
{
    if(top>=0)
    {
        cout<<"\n The elements in STACK \n";
        for(i=top; i>=0; i--)
           cout<<Stack[i]<<" ";
    }
    else
    {
        cout<<"\n The STACK is empty";
    }
   
}

int main()
{
	cin>>n;
	top=-1;
	push(10);
	push(20);
	push(40);
	push(10);
	cout<<endl<<pop();
	display();
	return 0;
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Apr 12 2022

Motionless Mink

0 Answers Avg Quality 2/10

stack implementation

Contents

More Related Answers

stack implementation

Closely Related Answers

stack function

how to implement stack

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.