链表倒置

class Node():
    def __init__(self, data=None, next=None):
        self.data = data
        self.next = next


root = Node(1, Node(2, Node(3, Node(4, Node(5, None)))))
def reverse(root):
    if root ==None:
        return None
    pre = root
    cur = root.next
    pre.next= None
    while cur:
        temp =cur.next
        cur.next = pre
        pre =cur
        cur = temp
    return pre
link = reverse(root)
while link:
    print(link.data)
    link =link.next