ADVERTISEMENT
ADVERTISEMENT

C program to find the largest element in the singly linked list

Here, we are going to learn how to find the largest element in the singly linked list using C program?
Submitted by Nidhi, on August 23, 2021

Problem Solution:

Given a singly linked list, we have to find the largest element.

Program:

The source code to find the largest element in a singly linked list is given below. The given program is compiled and executed using GCC compile on UBUNTU 18.04 OS successfully.

// C program to find the largest element
// in singly linked list

#include <stdio.h>
#include <stdlib.h>

//Self-referential structure to create the node.
typedef struct tmp {
    int item;
    struct tmp* next;
} Node;

//structure for creating the linked list.
typedef struct
    {
    Node* head;
    Node* tail;

} List;

//Initialize List
void initList(List* lp)
{
    lp->head = NULL;
    lp->tail = NULL;
}

//Create node and return the reference of it.
Node* createNode(int item)
{
    Node* nNode;

    nNode = (Node*)malloc(sizeof(Node));

    nNode->item = item;
    nNode->next = NULL;

    return nNode;
}

//Add a new item at the end of the list.
void addAtTail(List* lp, int item)
{
    Node* node;
    node = createNode(item);

    //if list is empty.
    if (lp->head == NULL) {
        lp->head = node;
        lp->tail = node;
    }
    else {
        lp->tail->next = node;
        lp->tail = lp->tail->next;
    }
}

//Add a new item at the beginning of the list.
void addAtHead(List* lp, int item)
{
    Node* node;
    node = createNode(item);

    //if list is empty.
    if (lp->head == NULL) {
        lp->head = node;
        lp->tail = node;
    }
    else {
        node->next = lp->head;
        lp->head = node;
    }
}

//To print the list from start to end of the list.
void printList(List* lp)
{
    Node* node;

    if (lp->head == NULL) {
        printf("\nEmpty List");
        return;
    }

    node = lp->head;

    while (node != NULL) {
        printf("| %05d |", node->item);
        node = node->next;

        if (node != NULL)
            printf("--->");
    }
    printf("\n\n");
}

int findLarge(List* lp)
{
    Node* temp;
    int large = 0;

    temp = lp->head;

    while (temp != NULL) {
        if (large < temp->item)
            large = temp->item;

        temp = temp->next;
    }

    return large;
}

//Main function to execute program.
int main()
{
    List* lp;
    int large = 0;

    lp = (List*)malloc(sizeof(List));

    initList(lp);

    addAtHead(lp, 100);
    addAtHead(lp, 200);
    addAtHead(lp, 300);
    addAtHead(lp, 200);
    addAtHead(lp, 100);

    printf("List:\n");
    printList(lp);

    large = findLarge(lp);

    printf("Largest element in Linked list is: %d\n", large);

    return 0;
}

Output:

List:
| 00100 |--->| 00200 |--->| 00300 |--->| 00200 |--->| 00100 |

Largest element in Linked list is: 300

Explanation:

Here, we created a self-referential structure to implement a linked list, a function to add a node at the start and end of the list, a function isPalindrome() to check linked list is palindrome or not. The isPalindrome() function returns 1 if the list is palindrome otherwise it will return 0.

In the main() function, we created a linked list. Then we checked the given list is palindrome or not using the isPalindrome() function and printed the appropriate message.

ADVERTISEMENT
ADVERTISEMENT


Comments and Discussions!



ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT

Languages: » C » C++ » C++ STL » Java » Data Structure » C#.Net » Android » Kotlin » SQL
Web Technologies: » PHP » Python » JavaScript » CSS » Ajax » Node.js » Web programming/HTML
Solved programs: » C » C++ » DS » Java » C#
Aptitude que. & ans.: » C » C++ » Java » DBMS
Interview que. & ans.: » C » Embedded C » Java » SEO » HR
CS Subjects: » CS Basics » O.S. » Networks » DBMS » Embedded Systems » Cloud Computing
» Machine learning » CS Organizations » Linux » DOS
More: » Articles » Puzzles » News/Updates

© https://www.includehelp.com some rights reserved.