Why does my Python linked-list reversal loop create a cycle?

Also, check for None before accessing head.next. If head is None, the original code raises an exception before reaching the condition that checks p1. In Python, use `is None` and `is not None` for None comparisons rather than `==` and `!=`.

Your code links the second node back to the first, but it never properly detaches the original first node. With a list like 1 -> 2 -> 3, assigning p2.next = p1 creates 1 2, which is a cycle. You also return the old head instead of the new one.

A minimal correction is:

p1 = head
if p1 is None:
return head

p2 = head.next
if p2 is None:
return head

p1.next = None

while p2 is not None:
temp = p2.next
p2.next = p1
p1 = p2
p2 = temp

return p1

Here, p1 ends up pointing to the new head.

The usual approach is to keep track of the previous node, the current node, and the next node. Save current.next before changing the link, then move all three references forward:

prev = None
curr = head

while curr is not None:
nxt = curr.next
curr.next = prev
prev = curr
curr = nxt

return prev

The returned node is prev because it becomes the new head of the reversed list.