Simple linked list implementation in Python

gistfile1.py

# From http://interactivepython.org/LpOMZ/courselib/static/pythonds/BasicDS/linkedlists.html
class Node:
  def __init__(self,initdata):
      self.data = initdata
      self.next = None

class LinkedList:
	def __init__( self ):
		self.head = None
		self.tail = None
	
	def add(self,data):
		new_node=Node(data)
		if self.head == None:
			self.head = new_node

		if self.tail != None:
			self.tail.next = new_node

		self.tail = new_node

	def reverseList(self):
		if self.head == None or self.head.next == None:
			return self.head
		
		to_do = self.head.next

		reversed_list = self.head
		reversed_list.next = None

		self.tail = reversed_list

		while to_do != None:
			temp = to_do
			to_do = to_do.next
			temp.next = reversed_list
			reversed_list = temp

		self.head = reversed_list
	
	def recursiveReverse(self, node):
		if node == None or node.next == None:
			return node

		reversed_list = self.recursiveReverse(node.next)

		node.next.next = node
		node.next = None

		return reversed_list

	def printList(self):
		node = self.head
		while node != None:
			print node.data
			node = node.next