Linked lists

Follow how nodes store values and references while insertion, deletion, and traversal reshape the chain.

Which directions must each node remember?

Choose by the decision you want to understand

Each lesson names the situation it fits and the behavior worth watching.

Start hereFollow next references

Choose it when: Understanding non-contiguous sequences
Watch for: Changing one reference can insert a node without shifting later values.

BeginnerLink both directions

Choose it when: Bidirectional traversal and deletion
Watch for: Extra references simplify backward movement but increase update work.

IntermediateReconnect tail to head

Choose it when: Round-robin and repeating sequences
Watch for: Traversal needs an explicit stopping rule because no node points to null.