a reverse LinkedList implementation in Python

revLinkedList.py

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


def makeLinkedList():
  head = Node(10)
  node = head
  for i in range(9,0,-1):
    nextNode = Node(i)
    node.nextNode = nextNode
    node = nextNode

  return head

def printLinkedList(head):
  print(head.data, end="")
  node = head
  while (node.nextNode != None):
    node = node.nextNode
    print(", "+ str(node.data), end="")
  print()
    

  
def revLinkedList(head):

  pastNode, curNode, nextNode = None, None, None
  
  curNode = head
  while(curNode.nextNode != None):
    nextNode = curNode.nextNode
    curNode.nextNode = pastNode 
    pastNode = curNode
    curNode = nextNode

  curNode.nextNode = pastNode
  return curNode

head = makeLinkedList()
printLinkedList(head)
head = revLinkedList(head)
printLinkedList(head)