simplest code for stack implementation in c++

Blue Baboon answered on April 26, 2021 Popularity 8/10 Helpfulness 2/10

answer simplest code for stack implementation in c++

related stack algorithm in c++

related simplest code for stack implementation in c++

related Basic stack implementation in c++

simplest code for stack implementation in c++

Comment

void push(int val) {
   if(top>=n-1)
   cout<<"Stack Overflow"<<endl;
   else {
      top++;
      stack[top]=val;
   }
}

Popularity 8/10 Helpfulness 2/10 Language cpp

Source: www.tutorialspoint.com

Tags: c++ implementation stack

Link to this answer
Share Copy Link

Contributed on Nov 01 2021

Blue Baboon

0 Answers Avg Quality 2/10

Closely Related Answers

stack algorithm in c++

Comment

#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
class stack

Popularity 1/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: algorithm c++ stack

Link to this answer
Share Copy Link

Contributed on Apr 26 2021

Excited Emu

0 Answers Avg Quality 2/10

simplest code for stack implementation in c++

Comment

void pop() {
   if(top<=-1)
   cout<<"Stack Underflow"<<endl;
   else {
      cout<<"The popped element is "<< stack[top] <<endl;
      top--;
   }
}

Popularity 8/10 Helpfulness 1/10 Language cpp

Source: www.tutorialspoint.com

Tags: c++ implementation

Link to this answer
Share Copy Link

Contributed on Nov 01 2021

Blue Baboon

0 Answers Avg Quality 2/10

simplest code for stack implementation in c++

Comment

void display() {
   if(top>=0) {
      cout<<"Stack elements are:";
      for(int i=top; i>=0; i--)
      cout<<stack[i]<<" ";
      cout<<endl;
   }else
   cout<<"Stack is empty";
}

Popularity 8/10 Helpfulness 1/10 Language cpp

Source: www.tutorialspoint.com

Tags: c++ implementation i

Link to this answer
Share Copy Link

Contributed on Nov 01 2021

Blue Baboon

0 Answers Avg Quality 2/10

Basic stack implementation in c++

Comment

-1

/* C++ program to implement basic stack
   operations */
#include <bits/stdc++.h>

using namespace std;

#define MAX 1000

class Stack {
    int top;

public:
    int a[MAX]; // Maximum size of Stack

    Stack() { top = -1; }
    bool push(int x);
    int pop();
    int peek();
    bool isEmpty();
};

bool Stack::push(int x)
{
    if (top >= (MAX - 1)) {
        cout << "Stack Overflow";
        return false;
    }
    else {
        a[++top] = x;
        cout << x << " pushed into stack\n";
        return true;
    }
}

int Stack::pop()
{
    if (top < 0) {
        cout << "Stack Underflow";
        return 0;
    }
    else {
        int x = a[top--];
        return x;
    }
}
int Stack::peek()
{
    if (top < 0) {
        cout << "Stack is Empty";
        return 0;
    }
    else {
        int x = a[top];
        return x;
    }
}

bool Stack::isEmpty()
{
    return (top < 0);
}

// Driver program to test above functions
int main()
{
    class Stack s;
    s.push(10);
    s.push(20);
    s.push(30);
    cout << s.pop() << " Popped from stack\n";
    //print all elements in stack :
    cout<<"Elements present in stack : ";
    while(!s.isEmpty())
    {
        // print top element in stack
        cout<<s.peek()<<" ";
        // remove top element in stack
        s.pop();
    }

    return 0;
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: basic basi

Link to this answer
Share Copy Link

Contributed on Jan 11 2022

Condemned Crocodile

0 Answers Avg Quality 2/10

simplest code for stack implementation in c++

Contents

More Related Answers

simplest code for stack implementation in c++

Closely Related Answers

stack algorithm in c++

simplest code for stack implementation in c++

simplest code for stack implementation in c++

Basic stack implementation in c++

Grepper

Documentation

Social

Legal

Contact

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