Doubly Linked List Simulator
Track prev and next together through insertion and deletion at both ends.
head
null
Empty list. head and tail are null; every node stores both prev and next.
step 1 of 7
node created or removednode being comparedpointer rewritten
Operations
State
- Length
- 0 / 8
- head
- null
- tail
- null
Every node carries prev as well as next, so deletion needs no walk to find the predecessor — but every insert rewires twice as many pointers.
← → to step, or use the buttons above.