-
Notifications
You must be signed in to change notification settings - Fork 0
/
Stack.h
93 lines (82 loc) · 1.41 KB
/
Stack.h
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
#pragma once
#pragma once
#include <iostream>
template <typename data>
class Stack {
class SNode {
public:
data Data;
SNode* Next;
SNode(const data val = 0, SNode* nex = nullptr)
{
Data = val;
Next = nex;
}
};
private:
SNode* Top;
public:
Stack();
void Pop();
void Display();
bool IsEmpty();
void Pop(data);
const data Peek();
void Push(const data);
~Stack();
};
template<typename data>
inline Stack<data>::Stack()
{
Top = nullptr;
}
template<typename data>
inline void Stack<data>::Push(const data val)
{
SNode* temp = new SNode(val, Top);
Top = temp;
}
template<typename data>
inline void Stack<data>::Pop()
{
if (IsEmpty())
return;
SNode* temp = Top;
Top = Top->Next;
delete temp;
}
template<typename data>
inline bool Stack<data>::IsEmpty()
{
return Top == nullptr;
}
template<typename data>
inline const data Stack<data>::Peek()
{
if (!IsEmpty())
return Top->Data;
return (-1);
}
template<typename data>
inline void Stack<data>::Display()
{
for (SNode* curr = Top; curr != nullptr; curr = curr->Next)
std::cout << curr->Data << " ";
}
template<typename data>
inline Stack<data>::~Stack()
{
SNode* temp;
while (Top != nullptr)
{
temp = Top;
Top = Top->Next;
delete temp;
}
}
template<typename data>
inline void Stack<data>::Pop(data ResVar)
{
ResVar = Top->Data;
this->Pop();
}