Linked List (ADT) Simulator
Insert, delete and traverse while every next pointer is redrawn as it changes.
head
null
Empty list. head is null; every node stores one next pointer.
step 1 of 7
node created or removednode being comparedpointer rewritten
Operations
State
- Length
- 0 / 8
- head
- null
- tail
- null
Insert at head is O(1); everything else needs a walk from head. Watch the rewiring order on insert-at — writing the previous node's next first would strand the rest of the list.
← → to step, or use the buttons above.