Multiple choice

How many pointer fields are used in reversing a list?

  1. 4

  2. 3

  3. 2

  4. 1
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Reversing a linked list requires three pointer fields to safely restructure the list without losing references. These are typically the current node being processed, the next node to process, and the previous node that needs to be linked back. This three-pointer technique allows in-place reversal.

Keep practicing — related questions