Lecture 177:- Maximum Element in a Linked List

To find the maximum element in a singly linked list, you need to traverse the list from the head node to the tail node while keeping track of the maximum value encountered so far. Here's the C++ code to find the maximum element in a singly linked list:

cppCopy code

#include <iostream> using namespace std; // Node structure for singly linked list struct Node {    int data;    Node* next; }; // Function to create a new node with the given data Node* createNode(int data) {    Node* newNode = new Node();    newNode->data = data;    newNode->next = nullptr;    return newNode; } // Function to insert a new node at the end of the linked list void insertEnd(Node*& head, int data) {    Node* newNode = createNode(data);    if (head == nullptr) {        head = newNode;        return;    }    Node* temp = head;    while (temp->next != nullptr) {        temp = temp->next;    }    temp->next = newNode; } // Function to find the maximum element in the linked list int findMaxElement(Node* head) {    if (head == nullptr) {        // Empty list, return an appropriate value (e.g., -1)        return -1;    }    int maxElement = head->data;    Node* current = head->next;    while (current != nullptr) {        if (current->data > maxElement) {            maxElement = current->data;        }        current = current->next;    }    return maxElement; } // Function to free memory allocated for the linked list void deleteLinkedList(Node*& head) {    while (head != nullptr) {        Node* temp = head;        head = head->next;        delete temp;    } } int main() {    Node* head = nullptr;    // Inserting elements into the linked list    insertEnd(head, 3);    insertEnd(head, 8);    insertEnd(head, 5);    insertEnd(head, 10);    insertEnd(head, 2);    // Finding the maximum element in the linked list    int maxElement = findMaxElement(head);    if (maxElement != -1) {        cout << "Maximum element in the linked list: " << maxElement << endl;    } else {        cout << "The linked list is empty." << endl;    }    // Free memory and delete the linked list    deleteLinkedList(head);    return 0; }

In this code, we define a Node structure to represent each element in the linked list. The createNode function is used to create a new node with the given data. The insertEnd function inserts a new node at the end of the linked list. The findMaxElement function finds the maximum element in the linked list while traversing the list.

When you run this code, it will display the maximum element in the linked list, which, for the given linked list, will be 10. If the linked list is empty, it will display a message indicating that the list is empty.