Notes

#include <iostream>

using namespace std;

class Node {
public:
int data;
Node* next;

Node(int value) {
data = value;
next = nullptr;
}
};

class CircularLinkedList {
public:
Node* head;

CircularLinkedList() {
head = nullptr;
}

void push(int data) {
Node* new_node = new Node(data);
if (!head) {
head = new_node;
new_node->next = head;
} else {
new_node->next = head;
Node* temp = head;
while (temp->next != head) {
temp = temp->next;
}
temp->next = new_node;
head = new_node;
}
}

string pop() {
if (!head) {
return "Tumpukan kosong";
}

if (head->next == head) {
int popped = head->data;
delete head;
head = nullptr;
return "Data yang di-pop: " + to_string(popped);
} else {
Node* temp = head;
Node* prev = nullptr;
while (temp->next != head) {
prev = temp;
temp = temp->next;
}
prev->next = head;
int popped = temp->data;
delete temp;
return "Data yang di-pop: " + to_string(popped);
}
}

string displayStack() {
if (!head) {
return "Tumpukan kosong";
}

string result = "Isi tumpukan: ";
Node* temp = head;
do {
result += to_string(temp->data) + " ";
temp = temp->next;
} while (temp != head);
return result;
}
};

class CircularQueue {
public:
Node* front;
Node* rear;

CircularQueue() {
front = rear = nullptr;
}

void enqueue(int data) {
Node* new_node = new Node(data);
if (!front) {
front = rear = new_node;
rear->next = front;
} else {
new_node->next = front;
rear->next = new_node;
rear = new_node;
}
}

string dequeue() {
if (!front) {
return "Antrian kosong";
}

if (front == rear) {
int dequeued = front->data;
delete front;
front = rear = nullptr;
return "Data yang di-dequeue: " + to_string(dequeued);
} else {
Node* temp = front;
front = front->next;
rear->next = front;
int dequeued = temp->data;
delete temp;
return "Data yang di-dequeue: " + to_string(dequeued);
}
}

string displayQueue() {
if (!front) {
return "Antrian kosong";
}

string result = "Isi antrian: ";
Node* temp = front;
do {
result += to_string(temp->data) + " ";
temp = temp->next;
} while (temp != front);
return result;
}
};

// Contoh penggunaan
int main() {
CircularLinkedList stack;
stack.push(1000);
stack.push(1001);
stack.push(1002);

cout << stack.displayStack() << endl;
cout << stack.pop() << endl;
cout << stack.displayStack() << endl;

CircularQueue queue;
queue.enqueue(1000);
queue.enqueue(1001);
queue.enqueue(1002);

cout << queue.displayQueue() << endl;
cout << queue.dequeue() << endl;
cout << queue.displayQueue() << endl;

return 0;
}