In [22]:

    

from node_class import node
class LinkedList:
    def __init__(self):
        self.head = None
        self.size = 0
        
    def insert(self,data):
        n = node(data)
        n.next = self.head
        self.head = n
        self.size += 1
    def append(self,data):
        if self.head is None:
            self.head = node(data)
        else:
            n = node(data)
            n.next = None
            nodes = self.head
            while nodes.next is not None:
                nodes = nodes.next
            nodes.next = n
        self.size +=1
    def __len__(self):
        return self.size
    
    def __str__(self):
        node = self.head
        result = ''
        while node:
            value = node.data
            node = node.next
            result += '->'+str(value)
        return result


    

In [26]:

    

ll = LinkedList()
ll.insert(2)
ll.insert(3)
ll.insert(5)
ll.append(10)
ll.append(123)
print ll.__str__()
ll.size


    

    




->5->3->2->10->123






    
Out[26]:





5

In [27]:

    

llll = LinkedList()
llll.insert(2)
print llll


    

    




->2

In [28]:

    

lll = LinkedList()
lll.append(10)
print lll


    

    




->10

In [ ]: