Define a class named LinkedList that represents a singly linked list. The class should have the following member functions: Linked List: A constructor that initializes an empty linked list. void insertAtEnd(int data): Inserts a new node with the given data at the end of the linked list. void deleteNode(int data): Deletes the first occurrence of the node with the specified data from the linked list. void display(): Displays the elements of the linked list. Additionally, implement a function int countNodes() outside the class that returns the total number of nodes in the linked list. Create a program to test the functionality of the Linked List class. Use the following code as a starting point: #include using namespace std; // Define the Linked List class here int countNodes(const LinkedList& list); int main() { Linked List myList; // Create an empty linked list // Test the insertAtEnd function myList.insertAtEnd(10); myList.insertAtEnd(20); myList.insertAtEnd(30); } cout << "Initial Linked List: "; myList.display(); cout <<< endl; // Test the deleteNode function myList.deleteNode(20); cout << "Linked List after deleting 20: "; myList.display(); cout << endl; // Test the countNodes function cout << "Number of nodes in the linked list: " << countNodes(myList) << endl; return 0;

[画像:Computer Science]

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.