stack.cpp

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

class StackUsingArray {
    int *data;
    int nextIndex;
    int capacity;
    public :

    StackUsingArray(int totalSize){
        data = new int[totalSize];
        nextIndex = 0;
        capacity =totalSize;
    }
    // return the no. of elemnt present in my stack
    int size()
    {
        return nextIndex;
    }
    bool isEmpty()
    {/*
        if(nextIndex==0){
            return true;
        }
        else {
            return false;
        }*/
        return nextIndex == 0;
    }
    // inset elemnt
    void push(int element){
        if(nextIndex == capacity)
        {
            cout <<"stackfull"<< endl;
            return;
        }
        data[nextIndex] = element;
        nextIndex++;
    }
    // del
    int pop(){
        if(isEmpty()){
            cout <<"stack is empy"<<endl;
            return INT_MIN;
        }
        nextIndex--;
        return data[nextIndex];
    }
    int top()
    {
        if(isEmpty() ){
            cout <<"stack is empy"<<endl;
            return INT_MIN;
        }
        return data[nextIndex - 1];
    }

};


int main()
{
    StackUsingArray s(4);
    s.push(10);
    s.push(20);
    s.push(30);
    s.push(40);
    s.push(50);

    cout << s.top() << endl;
    cout << s.pop() << endl;
    cout << s.pop() << endl;
    cout << s.pop() << endl;
    cout << s.size() << endl;
    cout << s.isEmpty() << endl; 

}