Insert at Tail
Walk to the last node and attach the new node after it.
Result · step 5 of 6Singly Linked List: Insert at the tail
2 is the last node: point its next at the new node 9.
What you will see
A pointer walks to the end; the last node's null arrow reattaches to the new node.
Cost
| Best | O(1) |
|---|---|
| Average | O(n) |
| Worst | O(n) |
| Space | O(1) |
O(1) with a tail pointer.
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
Related
Taught by the same lesson
Singly Linked List covers these too, in the same run.