-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.cpp
More file actions
140 lines (136 loc) · 3.15 KB
/
Stack.cpp
File metadata and controls
140 lines (136 loc) · 3.15 KB
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#include <iostream>
using namespace std;
template <class StackObject>
struct StackNode
{
StackObject data;
StackNode<StackObject> *next = nullptr;
};
template <class StackObject>
class Stack
{
StackNode<StackObject> *top;
public:
Stack()
{
top = nullptr;
}
Stack(StackObject entry)
{
top = new StackNode<StackObject>;
top->data = entry;
}
bool isEmpty()
{
return top == nullptr;
}
bool push(StackObject entry)
{
if (entry == StackObject())
{
return false;
}
if (this->isEmpty())
{
top = new StackNode<StackObject>;
top->data = (entry);
top->next = nullptr;
return true;
}
else
{
StackNode<StackObject> *newNode = new StackNode<StackObject>;
newNode->data = (entry);
newNode->next = top;
top = newNode;
return true;
}
return true;
}
StackObject pop()
{
StackNode<StackObject> *deletionNode = top;
if (this->isEmpty())
{
return StackObject();
}
StackObject temp = top->data;
top = top->next;
delete deletionNode;
return temp;
}
StackObject peek()
{
if (this->isEmpty())
{
return StackObject();
}
return top->data;
}
int length()
{
int count = 0;
StackNode<StackObject> *currentNode = top;
while (currentNode != nullptr)
{
count++;
currentNode = currentNode->next;
}
return count;
}
void display()
{
cout << "{";
StackNode<StackObject> *currentNode = top;
while (currentNode)
{
cout << currentNode->data << ", ";
currentNode = currentNode->next;
}
if (currentNode == top)
cout << "}" << endl;
else
cout << "\b\b}" << endl;
}
void clear()
{
while (!this->isEmpty())
{
pop();
}
}
Stack(Stack &stack)
{
this->top = new StackNode<StackObject>;
this->top->data = stack.top->data;
StackNode<StackObject> *current = stack.top;
StackNode<StackObject> *new_node = this->top;
while (current->next != nullptr)
{
new_node->next = new StackNode<StackObject>;
new_node = new_node->next;
current=current->next;
new_node->data = current->data;
}
}
Stack<StackObject>& operator=(Stack<StackObject> &stack)
{
this->clear();
this->top = new StackNode<StackObject>;
this->top->data = stack.top->data;
StackNode<StackObject> *current = stack.top;
StackNode<StackObject> *new_node = this->top;
while (current->next != nullptr)
{
new_node->next = new StackNode<StackObject>;
new_node = new_node->next;
current=current->next;
new_node->data = current->data;
}
return *this;
}
~Stack()
{
clear();
}
};