📝 **Task:** Build a 3-node linked list 1→2→3, reverse it with `reverse(head)`, then print values starting from the new head. Expected output: 3 2 1. 📋 Implement the function above. Test cases run automatically. 💡 **Hint:** Re-read the theory if you get stuck — the pattern is right there.