Reverse a Linked List

EasyPython

Given the head of a singly linked list, reverse the list and return the new head.

Implement the reversal in-place by changing the next pointers. Do not create a new list or copy node values.

Formal Specification

Input: head, the head node of a singly linked list, or None for an empty list.
Output: The head node of the reversed linked list.

def reverse_list(head):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.