Python implements unordered list

class Node:
    def __init__(self, initdata):
        self.data = initdata
        self.next = None

    def getData(self):
        return self.data

    def getNext(self):
        return self.next

    def setData(self, newdata):
        self.data = newdata

    def setNext(self,newnext):
        self.next = newnext

class UnorderList:
    def __init__(self):
        self.head = None

    def isEmpty(self):
        return self.head == None

    def add(self, item):
        temp = Node(item)
        temp.setNext(self.head)
        self.head = temp

    def length(self):
        current = self.head
        count = 0
        while current != None:
            count = count + 1
            current = current.getNext()

        return count

    def search(self, item):
        current = self.head
        found = False
        while current!= None  and found != True:
            if current.getData() == item:
                found = True
            else:
                current = current.getNext()
        return found

    def remove(self,item):
        previous = None
        current = self.head
        found = False
        while not found:
            if current.getData() == item:
                found = True
            else:
                previous = current
                current = current.getNext()

        if previous == None:
            self.head = current.getNext()
        else:
            previous.setNext(current.getNext())

    def index(self,number):
        current = List.head
        for i in range(self.length()-1-number):
            current = current.getNext()
        return current.getData()

    def pop(self):
         self.remove(self.index(self.length()-1))




List = UnorderList()
List.add(1)
List.add(3)
List.add(6)
List.add(8)
print(List.length())
List.pop()
print(List.length())
List.add(10)
print(List.length())
print(List.search(1))
print(List.index(0))
print(List.index(1))
print(List.index(2))
print(List.index(3))

The experimental results are as follows: