Walk through a linked list from head to tail by following each node's next pointer. Unlike arrays, there's no index — you must start at the head and follow the chain.
time:O(n)
space:O(1)
⚡ +100_XP
step[1/11]
> Start
→
3
→
7
→
12
→
5
null
9
▸Linked List: each node holds a value and a → pointer to the next node. No random access — must traverse from head.
// tap NEXT STEP to walk through one step at a time