Linked list inversion python

def reverse_node_list(head):    ifnotornot head.next:        return head    =None    while head:        = head        = head.next        curr.next= prev        = curr    return prev

Set three pointers, Prev points to the previous node, head points to the current node, Curr points to the next node to go
Initialization
Prev Empty
Head Table Header

Keep the current node first
Nudge pointer
Current node inversion
Nudge Prev

Linked list inversion python