Notes

#include <iostream>
using namespace std;

struct Node {
int data;
Node* next;
};

class LinkedList {
private:
Node* head;

public:
LinkedList() {
head = NULL; // Replace nullptr with NULL
}

// Function to add an element to the front of the linked list
void addToFront(int value) {
Node* newNode = new Node;
newNode->data = value;
newNode->next = head;
head = newNode;
}

// Function to add an element to the back of the linked list
void addToBack(int value) {
Node* newNode = new Node;
newNode->data = value;
newNode->next = NULL; // Replace nullptr with NULL

if (!head) {
head = newNode;
return;
}

Node* current = head;
while (current->next) {
current = current->next;
}
current->next = newNode;
}

// Function to add an element in sorted order
void addSorted(int value) {
Node* newNode = new Node;
newNode->data = value;
newNode->next = NULL; // Replace nullptr with NULL

if (!head || head->data >= value) {
newNode->next = head;
head = newNode;
} else {
Node* current = head;
while (current->next && current->next->data < value) {
current = current->next;
}
newNode->next = current->next;
current->next = newNode;
}
}

// Function to search for an element in the linked list
bool search(int value) {
Node* current = head;
while (current) {
if (current->data == value) {
return true;
}
current = current->next;
}
return false;
}

// Function to delete the first element from the linked list
void deleteFront() {
if (head) {
Node* temp = head;
head = head->next;
delete temp;
}
}

// Function to find the minimum and maximum values in the linked list
void findMinMax(int& minVal, int& maxVal) {
if (!head) {
minVal = maxVal = 0;
return;
}

Node* current = head;
minVal = maxVal = current->data;

while (current) {
if (current->data < minVal) {
minVal = current->data;
}
if (current->data > maxVal) {
maxVal = current->data;
}
current = current->next;
}
}

// Function to display the linked list
void display() {
Node* current = head;
while (current) {
cout << current->data << " ";
current = current->next;
}
cout << endl;
}
};

int main() {
LinkedList myList;
int choice, value;

do {
cout << "========== MENU ==========" << endl;
cout << "1. Add Depan" << endl;
cout << "2. Add Belakang" << endl;
cout << "3. Add Terurut" << endl;
cout << "4. Pencarian" << endl;
cout << "5. Hapus Depan" << endl;
cout << "6. Min & Max" << endl;
cout << "7. Tampilan" << endl;
cout << "===================" << endl;
cout << "0. Exit" << endl;
cout << "===================" << endl;
cout << "Enter your choice: ";
cin >> choice;

switch (choice){
case 1:
cout << "Masukkan nilai yang di depan: ";
cin >> value;
myList.addToFront(value);
break;

case 2:
cout << "Masukkan nilai yang di belakang: ";
cin >> value;
myList.addToBack(value);
break;

case 3:
cout << "Masukkan nilai yang berdasarkan urutan: ";
cin >> value;
myList.addSorted(value);
break;

case 4:
cout << "Masukkan nilai yang di cari: ";
cin >> value;
if (myList.search(value)) {
cout << "Nilai yang di list ditemukan." << endl;
} else {
cout << "Nilai yang di list tidak ditemukan." << endl;
}
break;

case 5:
myList.deleteFront();
break;

case 6:
int minVal, maxVal;
myList.findMinMax(minVal, maxVal);
cout << "Nilai minimum: " << minVal << endl;
cout << "Nilai maximum: " << maxVal << endl;
break;

case 7:
myList.display();
break;

case 0:
cout << "Keluar program." << endl;
break;

default:
cout << "Pilihan tidak ada, Silakan coba lagi" << endl;
}
} while (choice != 0);

return 0;
}