Python Linked List

Hello there! Ever wondered how to manage data in a way that’s efficient, flexible, and easy to manipulate? Well, you’re in luck! Today, we’re diving into the world of Python Linked Lists. Buckle up, and let’s get started!

Understanding the Basics of Linked List

A linked list is a linear data structure where each element is a separate object called a node. Each node consists of two components:

  • Data: It holds the actual value or data associated with the node.
  • Next Pointer: It stores the memory address (reference) of the next node in the sequence.

But why do we need a linked list data structure, you ask? Well, imagine you’re organizing a party and you have a list of guests. If a new guest arrives, you wouldn’t scrap the entire list and start over, right? That’s where linked lists come in handy!

Types of Linked Lists

Linked lists come in three main flavors:

  1. Single-linked list: Like a one-way street, it’s a list where each node points to the next node in the sequence and the last node points to null, indicating the end of the list. For example, consider a list of integers 1, 2, and 3. In a singly linked list, 1 would point to 2, 2 would point to 3, and 3 would point to null.
  2. Double-linked list: This is a two-way street. Here, each node has a reference to both the next node and the previous node. No more U-turns! For example, in a doubly linked list of the same integers, 1 would point to 2 and null, 2 would point to 1 and 3, and 3 would point to 2 and null.
  3. Circular linked list: Ever seen a roundabout? That’s a circular linked list for you! The last node points back to the first node making the whole list a loop. For example, in a circular linked list of the same integers, 1 would point to 2, 2 would point to 3, and 3 would point back to 1.

Operations on Linked Lists

Linked lists are like a Swiss Army knife with a variety of operations:

  • Insertion: Adding a new node is as easy as pie. You can add a node at the beginning, end, or even in the middle of the list. For example, if you want to add the integer 4 at the end of our list, you would create a new node with the data 4 and have the node 3 point to it.
  • Deletion: Removing a node is a breeze. Whether it’s the first, last, or a specific node, linked lists got you covered. For example, if you want to remove the integer 2 from our list, you would simply have the node 1 point to the node 3.
  • Searching: Looking for a node? Traverse the list from the head node and you’ll find what you’re looking for. For example, if you’re looking for the integer 3 in our list, you would start at the node 1, move to the node 2, and then finally arrive at the node 3.

Practical Implementation of Python Linked List

Let’s roll up our sleeves and dive into some code. We’ll create a singly linked list, append some items, and iterate through the list.

class Node:
    def __init__(self, data=None): = data = None

class LinkedList:
    def __init__(self):
        self.head = Node()

    # Append method to add node at the end
    def append(self, data):
        new_node = Node(data)
        cur = self.head
            cur = = new_node

    # Method to display the linked list
    def display(self):
        elems = []
        cur_node = self.head
            cur_node =

my_list = LinkedList()



When you run this code, it will display [1, 2, 3]. That’s your linked list!

Advantages and Disadvantages of Linked Lists

Linked lists are like a double-edged sword. They have their pros and cons.


  • Dynamic Size: Linked lists can grow or shrink dynamically, as memory allocation is done at runtime.
  • Insertion and Deletion: Adding or removing elements from a linked list is efficient, especially for large lists.
  • Flexibility: Linked lists can be easily reorganized and modified without requiring a contiguous block of memory.


  • Extra Memory: Linked lists require additional memory for storing the pointers, compared to arrays. It’s like paying extra for checked baggage on a flight!
  • No Random Access: Linked lists don’t support direct access to the elements. You have to start from the head and follow the references to the desired node. It’s like playing a game of treasure hunt!


And there you have it! A comprehensive guide to Python Linked Lists. From understanding the basics to implementing your own linked list in Python, we’ve covered it all. Remember, practice makes perfect. So, don’t forget to get your hands dirty with some coding!

Frequently Asked Questions (FAQ)

  • Can Python do linked lists?

    Absolutely! Python may not have a built-in linked list class, but we can easily create one using a class and pointers.

  • Does Python have a built-in linked list class?

    No, Python doesn’t have a built-in linked list class. But don’t worry, creating one is a piece of cake!

  • How do you print data from a linked list in Python?

    To print data from a linked list in Python, youcan traverse the list from the head node and print the data of each node.

  • What is the difference between ListNode and list in Python?

    A ListNode is a node in a linked list, while a list is a built-in data type in Python that can be used to create a linked list.

  • What is everything about linked list in Python?

    A linked list in Python is a linear collection of data organized as nodes that link to another node. It’s a dynamic data structure that allows efficient insertion and deletion of elements.

  • Can we store different data types in linked list in Python?

    Yes, a linked list in Python can store different data types. Each node in the linked list can store a data of any type.

  • When would you use a linked list in Python?

    Linked lists are used in Python when you need a data structure with dynamic size, efficient insertion and deletion, and does not require random access to elements.

  • What is the time complexity of a linked list in Python?

    The time complexity of accessing an element in a linked list is O(n), while insertion and deletion at a known position is O(1).

  • How to create a doubly linked list in Python?

    To create a doubly linked list in Python, you would define a class for the node with three attributes: data, next, and prev. The next attribute points to the next node, and the prev attribute points to the previous node.

Scroll to Top