what is the main purpose of DSA

Question

Shivam Payasi · Answer

#include // Node structure struct Node { int data; Node* next; // Constructor Node(int val) : data(val) next(nullptr) {} }; // Linked list class class LinkedList { private: Node* head; public: // Constructor LinkedList() : head(nullptr) {} // Destructor ~LinkedList() { Node* current = head; while (current != nullptr) { Node* temp = current; current = current->next; delete temp; } } // Function to insert a new node at the beginning void insertAtBeginning(int val) { Node* newNode = new Node(val); newNode->next = head; head = newNode; } // Function to insert a new node at the end void insertAtEnd(int val) { Node* newNode = new Node(val); if (head == nullptr) { head = newNode; return; } Node* current = head; while (current->next != nullptr) { current = current->next; } current->next = newNode; } // Function to display the linked list void display() { Node* current = head; while (current != nullptr) { std::cout data ; current = current->next; } std::cout data == val) return true; current = current->next; } return false; } // Function to delete a node by value void deleteNode(int val) { Node* current = head; Node* prev = nullptr; while (current != nullptr && current->data != val) { prev = current; current = current->next; } if (current == nullptr) return; // Value not found if (prev == nullptr) head = head->next; // If the value is in the first node else prev->next = current->next; delete current; } }; int main() { LinkedList list; // Inserting elements list.insertAtEnd(1); list.insertAtEnd(2); list.insertAtEnd(3); list.insertAtBeginning(0); // Displaying the list std::cout