Basic stack implementation in c++

/* 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;
}

Source: geeksforgeeks.org

Similar codes

0 vote110 views1 answer
Argument to number C++
C++
1 vote108 views1 answer
Eosio require_find
C++
0 vote121 views1 answer
Json::iterator c++
C++
2 votes123 views2 answers
Cannot open include file:
C++
0 vote115 views1 answer
C++ fast
C++
0 vote107 views1 answer
Dynamic memory in c++
C++
0 vote108 views1 answer
Reverse Square Root
C++
0 vote114 views1 answer
How to downgrade numpy
C++
4 votes111 views1 answer
C++ measure time
C++
2 votes108 views1 answer
Web scraping with cpp
C++