Singlely Linked List | Python Fiddle

#!/usr/bin/env python

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None
        
class LinkedList:
    def __init__(self):
        self.head = None
        self.tail = None
        
    def addNode(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 removeNode(self, index):
        prev = None
        node = self.head
        i = 0
        
        while ( node !=	None) and ( i < index ):
            prev = node
            node = node.next
            i += 1
            
        if prev == Node:
            self.head = node.next
        else:
            prev.next = node.next
            
    def printList(self):
        node = self.head
        while node!= None:
            print node.data
            node = node.next
            
l = LinkedList()
l.addNode(1)
l.addNode(2)
l.addNode(3)
l.addNode(4)
l.printList()
l.removeNode(3)
l.printList()

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE