-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstack_singlyLinkedList.cpp
More file actions
126 lines (104 loc) · 2.05 KB
/
Copy pathstack_singlyLinkedList.cpp
File metadata and controls
126 lines (104 loc) · 2.05 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
/*
* 2019.6.28
* data structure implementation - stack_singlyLinkedList
*/
#include <iostream>
using namespace std;
struct Node {
int data;
Node *next;
Node() {
data = 0;
next = NULL;
}
~Node() {
Node *temp = next;
if (temp->next != NULL)
next = next->next;
temp = NULL;
}
Node(int value) {
data = value;
next = NULL;
}
};
class StackSLL {
public:
int s_size;
Node *head;
StackSLL() {
s_size = 0;
head = NULL;
}
~StackSLL() {
Node *temp;
while (head != NULL) {
temp = head;
head = head->next;
}
head = NULL;
}
void push(int value) {
Node *new_node = new Node(value);
if (head == NULL)
head = new_node;
else {
Node *temp = head;
while (temp->next != NULL) {
temp = temp->next;
}
temp->next = new_node;
}
s_size++;
}
int top() {
if (head == NULL)
return -1;
else {
Node *temp = head;
while (temp->next != NULL) {
temp = temp->next;
}
return temp->data;
}
}
void pop() {
if (head == NULL)
return;
else {
Node *cur = head;
Node *temp = head;
while (cur->next != NULL) {
temp = cur;
cur = cur->next;
}
temp->next = NULL;
s_size--;
}
}
int size() {
return s_size;
}
bool empty() {
return head == NULL;
}
};
int main() {
StackSLL teacher;
Node A;
teacher.head = &A;
Node B;
A.next = &B;
Node C;
B.next = &C;
int arr[10] = {1, 2, 3, 4};
for (int i = 0; i < 6; i++) {
cout << arr[i] << endl;
}
*(arr + 4) = 10;
for (int i = 0; i < 6; i++) {
cout << arr[i] << endl;
}
cout << "GOOD?";
return 0;
}