Data-Structures/Stack.cpp at main · ayysana/Data-Structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <iostream>
using namespace std;


class Stack {
private:
    int* arr;
    int top_index;
    int capacity;

public:
    Stack(int cap) {
        capacity = cap;
        arr = new int[capacity];
        top_index = -1;
    }

    ~Stack() {
        delete[] arr;
    }

    bool isEmpty() {
        return top_index == -1;
    }

    bool isFull() {
        return top_index == capacity - 1;
    }

    void push(int x) {
        if (isFull()) {
            cout << "Stack Overflow\n";
            return;
        }
        arr[++top_index] = x;
    }

    void pop() {
        if (isEmpty()) {
            cout << "Stack Underflow\n";
            return;
        }
        top_index--;
    }

    int top() {
        if (isEmpty()) {
            cout << "Stack is empty\n";
            return -1;
        }
        return arr[top_index];
    }

    int size() {
        return top_index + 1;
    }

    void clear() {
        top_index = -1;
    }
};