Traversal
Follow next pointers from head until null.
Result · step 5 of 6Singly Linked List: Traverse
Visit 2. Its next is null: the end.
What you will see
A "current" pointer hops node to node along the arrows.
Cost
| Best | O(n) |
|---|---|
| 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
Leads to
Topics that need this one first.
Taught by the same lesson
Singly Linked List covers these too, in the same run.