Codes_of_data_stractures_using_cpp/stack_using_arry2.cpp at main · sadikmahmudadive/Codes_of_data_stractures_using_cpp · 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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include<iostream>
#define n 100

using namespace std;

class stack
{
    int* arr;
    int top;

    public:
    stack()
    {
        arr=new int[n];
        top= -1;
    }

    void push(int x)
    {
        if (top == n-1)
        {
            cout << "Stack overflow -_-" << endl;
            return;
        }

        top++;
        arr[top]=x;
    }

    void pop()
    {
        if (top == n-1)
        {
            cout << "No element to POP :(" << endl;
            return;
        }

        top--;
    }

    int Top()
    {
        if (top == n-1)
        {
            cout << "No elements in stack" << endl;
            return -1;
        }

        return arr[top];
    }

    bool empty()
    {
        return top== -1;
    }
};

int main()
{
    stack st;
    st.push(1);
    st.push(2);
    st.push(3);
    cout << "Top most element is: " <<st.Top() <<endl;

    st.pop();
    cout << "Top most element after pop is: " <<st.Top() <<endl;

    st.pop();
    st.pop();
    st.pop();
    st.pop();
    cout <<st.empty() <<endl;

    return 0;
}