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.
Given an integer A. Compute and return the square root of A. If A is…
Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…
A heap is a specialized tree-based data structure that satisfies the heap property. It is…
What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…
A Binary Search Tree (BST) is a type of binary tree that satisfies the following…