-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue_linked_list.cpp
91 lines (74 loc) · 1.97 KB
/
queue_linked_list.cpp
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
#include <iostream>
#include <cstdlib>
enum class NivelStudii {
Licenta,
Masterat
};
struct Student {
int id;
std::string specialitatea;
NivelStudii nivelStudii;
};
struct Node {
Student data;
Node* next;
};
class Queue {
private:
Node* front; // referinta la primul node din lista
Node* rear; // referinta la ultimul node din lista
public:
Queue() : front(nullptr), rear(nullptr) {}
~Queue() {
while (!isEmpty()) {
dequeue();
}
}
bool isEmpty() const {
return front == nullptr;
}
void enqueue(const Student& student) {
Node* newNode = new Node{student, nullptr};
if (rear == nullptr) {
// daca lista e goala, front si rear trebuie sa fie newNode
front = rear = newNode;
} else {
// altfel, rear->next trebuie sa fie newNode
rear->next = newNode;
rear = newNode;
}
}
void dequeue() {
if (isEmpty()) {
std::cerr << "Queue is empty" << std::endl;
return;
}
Node* temp = front;
front = front->next;
// daca lista e goala, rear trebuie sa fie nullptr
if (front == nullptr) {
rear = nullptr;
}
delete temp;
}
Student frontStudent() const {
if (isEmpty()) {
std::cerr << "Queue is empty" << std::endl;
exit(EXIT_FAILURE);
}
return front->data;
}
};
int main() {
Queue queue;
queue.enqueue({1, "Computer Science", NivelStudii::Licenta});
queue.enqueue({2, "Physics", NivelStudii::Masterat});
Student s = queue.frontStudent();
std::cout << "Front student ID: " << s.id << ", Speciality: " << s.specialitatea << std::endl;
queue.dequeue();
if (!queue.isEmpty()) {
s = queue.frontStudent();
std::cout << "Front student ID: " << s.id << ", Speciality: " << s.specialitatea << std::endl;
}
return 0;
}