find the largest node in a linked list in python

To find the largest node in a linked list, we will iterate through each node of the linked list and compare the value of each node with a variable maximum. We will initialize maximum to the value of the first node of the linked list. For every node, we will compare the value of the current node with maximum and update maximum if the value of the current node is greater than the value of maximum.

Here's the code:

main.py
class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

def find_maximum(head):
    if not head:
        return None

    maximum = head.data
    current = head

    while current:
        if current.data > maximum:
            maximum = current.data
        current = current.next

    return maximum
339 chars
19 lines

We define a Node class with data and next attributes. The find_maximum function takes the head node of the linked list as input and returns the value of the largest node in the linked list.

We first check if the head node is None. If it is, we return None as there are no nodes in the linked list.

We initialize maximum variable to the value of the first node of the linked list. We set current pointer to head and iterate through each node of the linked list. For each node, we compare its value with the value of maximum and update maximum if its value is greater than the value of maximum.

Finally, we return the value of maximum, which is the largest value in the linked list.