class Node(object):
    value = None
    next_node = None


    def __init__(self, value):
        self.value = value
        self.next_node = None


class List1(object):
    size = 0
    head = None
    displayList = []

    def insert(self, val):
        new_node = Node(val)
        self.displayList.insert(0, val)
        new_node.next_node = self.head
        self.head = new_node
        print "head is now", self.head.value
        print "displayList: ", self.displayList


    def display(self):
        print self.head.value
    
    def pop(self):
        val = self.head.value
        self.displayList.pop(0)
        self.head = self.head.next_node
        print "displayList: ", self.displayList

        return val

    #def size():

    #def search(val):



l1 = List1()
l1.insert(5)
l1.insert(7)
l1.insert(9)
l1.insert(10)
l1.insert(33)
print l1.pop()
print l1.pop()

add rough draft of linked_list.py