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
If you like my post please follow me to read my latest post on programming and technology.
A builder plans to construct N houses in a row, where each house can be…
Find the length of the longest absolute path to a file within the abstracted file…
You manage an e-commerce website and need to keep track of the last N order…
You are given a stream of elements that is too large to fit into memory.…
The formula for the area of a circle is given by πr². Use the Monte…
Given an integer k and a string s, write a function to determine the length…