Categories: Data Structurepython

Implementation of Doubly Linked List in Python

In Doubly Linked List, We declare two pointers to store the location of the next Node and previous Node.

class DoublyLinkedListNode(object):
    
    def __init__(self,value):
        
        self.value = value
        self.next_node = None
        self.prev_node = None

Now that we have our node that can reference next and previous values, let’s begin to build out our linked list.

a = DoublyLinkedListNode(1)
b = DoublyLinkedListNode(2)
c = DoublyLinkedListNode(3)
Setting b after a
b.prev_node = a
a.next_node = b
Setting c after a
b.next_node = c
c.prev_node = b

Having a Doubly Linked list allows us to go though our Linked List forwards and backwards.

Recommended:

Understand Doubly Linked List Data Structure

Follow Me ❤😊

If you like my post please follow me to read my latest post on programming and technology.

Instagram

Facebook

Recent Posts

Factory Method Design Pattern in OODP

Factory Method is a creational design pattern that deals with the object creation. It separates…

2 days ago

Find Intersection of Two Singly Linked Lists

You are given two singly linked lists that intersect at some node. Your task is…

6 months ago

Minimum Cost to Paint Houses with K Colors

A builder plans to construct N houses in a row, where each house can be…

6 months ago

Longest Absolute Path in File System Representation

Find the length of the longest absolute path to a file within the abstracted file…

6 months ago

Efficient Order Log Storage

You manage an e-commerce website and need to keep track of the last N order…

7 months ago

Select a Random Element from a Stream

You are given a stream of elements that is too large to fit into memory.…

7 months ago