Let's test your knowledge. Click the correct answer from the options.
Which of the following is the correct algorithm to reverse a singly linked list?
Click the option that best answers the question.
- Iterate through the list and swap the data of adjacent nodes
- Traverse the list and update the `next` pointer of each node to its previous node
- Create a new linked list and insert each node at the beginning
- Reverse the data of each node in the list
