How to Find the Largest Element in a Doubly Linked List in Python

Submitted by razormist on Thursday, January 29, 2026 - 23:14.

In this tutorial, we will learn how to program “How to Find the Largest Element in a Doubly Linked List in Python.” The objective is to find the largest element in a doubly linked list. This tutorial will guide you step by step through the process of identifying the largest element. By the end of this tutorial, you will have a solid understanding of how to implement this task effectively in Python, helping you strengthen your problem-solving abilities and improve your coding skills.

This topic is straightforward and easy to understand. Simply follow the instructions provided, and you will complete it with ease. The program will guide you step by step through the process of finding the largest element in a doubly linked list. So, let’s dive into the coding process!

Getting Started:

First you will have to download & install the Python IDLE's, here's the link for the Integrated Development And Learning Environment for Python https://www.python.org/downloads/.

Creating Main Function

This is the main function of the application. The following code will display a simple GUI in terminal console that will display program. To do this, simply copy and paste these blocks of code into the IDLE text editor.

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None
        self.prev = None
 
 
class DoublyLinkedList:
    def __init__(self):
        self.first = None
        self.last = None
 
    def append(self, data):
        self.insert_at_end(Node(data))
 
    def insert_at_end(self, new_node):
        if self.last is None:
            self.first = new_node
            self.last = new_node
        else:
            new_node.prev = self.last
            self.last.next = new_node
            self.last = new_node
 
 
def find_largest(dllist):
    if dllist.first is None:
        return None
 
    largest = dllist.first.data
    current = dllist.first.next
 
    while current:
        if current.data > largest:
            largest = current.data
        current = current.next
 
    return largest
 
 
# ---------- MAIN PROGRAM ----------
 
while True:
    print("\n=============== Find the Largest Element in a Doubly Linked List ===============\n")
 
    a_dllist = DoublyLinkedList()
 
    data_list = input(
        "Please enter the elements in the doubly linked list: ").split()
 
    for data in data_list:
        a_dllist.append(int(data))
 
    largest = find_largest(a_dllist)
 
    if largest is not None:
        print(f"The largest element is {largest}.")
    else:
        print("The list is empty.")
 
    opt = input("\nDo you want to try again? (yes/no): ").strip().lower()
    if opt == "no":
        print("Exiting program...")
        break
    elif opt != "yes":
        print("Invalid choice. Exiting program...")
        break

This program illustrates how to find the largest element in a doubly linked list using Python. It defines a `Node` class containing data along with pointers to both the next and previous nodes, and a `DoublyLinkedList` class that manages node insertion at the end of the list. The user enters a sequence of numbers, which are stored as nodes in the doubly linked list. The `find_largest` function then traverses the list from the first node to the last, comparing each element to determine the maximum value present. If the list is empty, an appropriate message is displayed. The program is interactive and allows users to repeat the process or exit, making it a clear and practical demonstration of traversing and processing data in a doubly linked list.

Output:

There you have it we successfully created How to Find the Largest Element in a Doubly Linked List in Python. I hope that this simple tutorial help you to what you are looking for. For more updates and tutorials just kindly visit this site. Enjoy Coding!

More Tutorials for Python Language

Python Tutorials