Data-Structure/Stack.cpp at main · AsaHero/Data-Structure · 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
111
112
#include <iostream>

using namespace std;

template <class T>
class Stack{
private:
    T* arr;
    int top;
    int size;
public:

    Stack();
    Stack(int size);
    ~Stack();

    void push(T value);
    T pop();
    T peek();
    bool IsEmpty();
    bool IsFull();
};

template <class T>
Stack<T>::Stack()
{
    this->size = 0;
    this->arr = nullptr;
    this->top = -1;
}

template <class T>
Stack<T>::Stack(int size)
{
    this->size = size;
    arr = new T[this->size];
    this->top = -1;
}

template <class T>
Stack<T>::~Stack()
{
    delete[] this->arr;
}

template <class T>
void Stack<T>::push(T value)
{
    if(this->top + 1 < this->size)
    {
        this->top++;
        this->arr[top] = value;
    }
    else
        std::cout << "Overflow" << std::endl;

}

template <class T>
T Stack<T>::pop()
{
    if(this->top > -1)
    {
        T temp;
        temp = this->arr[top];
        top--;
        return temp;
    }
    else
        std::cout << "Underflow" << std::endl;

}

template <class T>
T Stack<T>::peek()
{
    return this->arr[top];
}

template <class T>
bool Stack<T>::IsEmpty()
{
    return this->top == -1;
}

template <class T>
bool Stack<T>::IsFull()
{
    return this->top == this->size - 1;
}


int main()
{

    Stack<int> stack(6);

    stack.push(15);
    stack.push(12);
    stack.push(5);
    stack.push(2);
    stack.push(1);
    stack.push(0);

    while (!stack.IsEmpty())
    {
        cout << stack.pop() << endl;
    }


    return 0;
}