Delete Node
Route the predecessor's pointer around the node, then drop it.
Decision · step 2 of 9Singly Linked List: Delete 4
5 is not 4: keep walking.
What you will see
The arrow into the node swings past it to the successor; the node fades out.
Cost
| Best | O(1) |
|---|---|
| Average | O(n) |
| Worst | O(n) |
| Space | O(1) |
How you work with it here
play it through, step one change at a time, scrub to any step, run it on your own input, predict what happens next, try operations in any order.
Screen readers: Each node announces its value and what it points to; each step announces the pointer change ("node 3 now points to node 5").
Reduced motion: Pointer arrows redraw in place with a brief emphasis instead of animating the detach and reattach.
Before this
Taught by the same lesson
Singly Linked List covers these too, in the same run.