Implementation_of_stack.cpp

#include<stack>
#include<iostream>
using namespace std;

class Stack {
    //properties
    public:

    int *arr;
    int top;
    int size;

    //behaviour
    Stack(int size) {
        this->size=size;
        arr=new int(size);
        top=-1;
    }

    void push(int element) {
        if(size-top>1) {
            top++;
            arr[top]=element;
        }
        else {
            cout<<"stack overflow"<<endl;
        }
    }

    void pop() {
        if(top>=0) {
            top--;
        }
        else {
            cout<<"stack underflow"<<endl;
        }
    }

    int peek() {
        if(top>=0) {
            return arr[top];
        }
        else {
            cout<<"stack is empty"<<endl;
            return -1;
        }
    }

    bool isempty() {
        if(top==-1) {
            return true;
        }
        else {
            return false;
        }
    }

};

int main() {
    Stack st(5);

    st.push(22);
    st.push(42);
    st.push(43);

    cout<<st.peek()<<endl;
    st.pop();
    cout<<st.peek()<<endl;
}