stack.cpp

#include <iostream>
using namespace std;
class Stack {
    int size;
    int *arr;
    int top;
public:
    Stack(int val) {
        this->size=val;
        arr=new int[val];
        top = -1;
    }

    // Check if stack is empty
    bool isEmpty() {
        return top == -1;
    }

    // Check if stack is full
    bool isFull() {
        return top == size - 1;
    }

    // Push element
    void push(int x) {
        if (isFull()) {
            cout << "Stack Overflow! Cannot push " << x << endl;
        } else {
            top++;
            arr[top] = x;
            cout << x << " pushed into stack." << endl;
        }
    }

    // Pop element
    void pop() {
        if (isEmpty()) {
            cout << "Stack Underflow! Nothing to pop." << endl;
        } else {
           
            cout << arr[top] << " popped from stack." << endl;
            top--;
        }
    }

    // Peek (top element)
    void peek() {
        if (isEmpty()) {
            cout << "Stack is empty!" << endl;
        } else {
            cout << "Top element is: " << arr[top] << endl;
        }
    }

    // Display stack
    void display() {
        if (isEmpty()) {
            cout << "Stack is empty!" << endl;
        } else {
            cout << "Stack elements (top to bottom): ";
            for (int i = top; i >= 0; i--) {
                cout << arr[i] << " ";
            }
            cout << endl;
        }
    }
};

int main() {
    int size;
    cout<<"enter the size of stack:";
    cin>>size;
    Stack s(size);
    

    return 0;
}