dare | Python Fiddle

# This is a comment
#
#  Simple implementation of a singly linked list
#

class Node(object):

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

class linkedList(object):

def __init__(self, head=None):
        self.head = head
        self.size = 0

def insert(self, node):

if not self.head:
            self.head = node
            self.size += 1
        else:
            # set new nodes pointer to old head
            node.nextNode = self.head
            # reset head to new node
            self.head = node
            self.size +=1

def getSize(self):
        return self.size

def printLL(self):
        mynode = self.head
	c = 0
        while mynode:
            c +=1
	    print(mynode.data c)
            mynode = mynode.nextNode

def getNum(self, lList, Node):
        if self.head == Node:
            return self.head
        else:
            if lList.head.nextNode:
                self.search(linkedList(lList.head.nextNode), value)
            else:
                raise ValueError("Node not in Linked List")

MyList = linkedList()

MyList.insert(Node("Lars"))
MyList.insert(Node("Alex"))
print(MyList.getSize())
MyList.insert(Node("Michael"))
print(MyList.getSize())
MyList.insert(Node("Abhi"))
              
# Use my print method
MyList.printLL()
print('\n')
MyList.getNum(2)

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