CP/stackintro.cpp at main · harsha094/CP · 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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
#include<iostream>
#include<stack>
using namespace std;

class stackintro
{


//properties
    public:
        int *arr;
        int top;
        int size;

//behaviour
    stackintro(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 Underflows"<<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(){
    stackintro st(5);

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

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

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

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

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

    if(st.isEmpty()){
        cout<<"Stack is empty buddy"<<endl;
    }
    else
    cout<<"Stack is not empty buddy"<<endl;


/*
    stack<int>s;
    //push operation
    s.push(2);
    s.push(3);

    //pop operation
    s.pop();

    cout<<"printing top element " << s.top()<<endl;

    if(s.empty()){
        cout<<"Stack is empty"<<endl;
    }
    else
    cout<<"Stack is not empty"<<endl;

    cout<<"Size of stack is "<<s.size()<<endl;
    */
    return 0;

}