#include // Define the node structure struct Node { int data; Node* next; Node(int value) : data(value), next(nullptr) {} }; // Function to traverse and print the linked list void traverseList(Node* head) { Node* current = head; while (current != nullptr) { std::cout data next; } std::cout next = new Node(2); head->next->next = new Node(3); head->next->next->next = new Node(4); // Traverse and print the linked list traverseList(head); // Clean up memory Node* temp; while (head != nullptr) { temp = head; head = head->next; delete temp; } return 0; }