What is the time complexity of reversing a linked list?

Approach: Analyze iterative pointer updates.

O(n). Each node's next pointer is updated exactly once during a single traversal.

Follow-up: Can it be done recursively?

Key concepts: pointers, linear time.