Free DSA visualization
Nodes + pointers. Insert/delete at a known node is O(1); finding it is O(n).
Step 1 of 3
List starts as 2 → 4 → null.
Complexity: O(1) time
Interview ask: Why is head insert O(1) for a singly linked list?