Approach Summary
Iterative: maintain prev, first, second. Re-link: prev → second → first → next. Advance by two nodes.
How to Recognize This Pattern
- Swap adjacent pairs in-place without modifying values
- Dummy head simplifies edge cases at the front
Complexity Analysis
Time Complexity
O(n)
Space Complexity
O(1)
Tags
Linked List Recursion