A
AiTechWorlds
AiTechWorlds
Visualize a doubly linked list with next/prev pointers — insert, delete, search, and reverse with synced code.
class Node:
def __init__(self, val):
self.val = val; self.prev = None; self.next = None
def push_back(self, v):
n = Node(v); n.prev = self.tail
if self.tail: self.tail.next = n
else: self.head = n
self.tail = nA doubly linked list gives each node two pointers — next and prev — allowing traversal in both directions and O(1) deletion when you already hold the node. It uses more memory than a singly linked list for the extra pointer.
| Insert at head | O(1) |
| Search / access | O(n) |
| Reverse | O(n) |
The Doubly Linked List Visualizer lets you insert, delete, search, and reverse a doubly linked list and watch the next and prev pointers update. Each node holds two pointers — to the next and previous node — enabling traversal in both directions and O(1) deletion when you already hold the node, at the cost of extra memory per node.
Insert nodes
Type a value and click Head or Tail; with a tail pointer, tail insertion is O(1).
Delete or search
Type a value and click Delete to remove it, or Search to highlight its node.
Reverse the list
Click Reverse to swap next/prev pointers throughout the list.
Read the code
See the doubly linked list code in C++, Java, Python, or JavaScript and copy it.
100% Private — No Server Required
All processing happens directly in your browser. No data is uploaded, stored, or transmitted to any server.
Last reviewed on June 14, 2026 by the AiTechWorlds Tools Team. All processing runs locally in your browser.