无序链表Python实现

#node类实现
#https://www.jianshu.com/p/7964c30197c0

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
#unorderedList
class UnorderedList:
    def __init__(self):
        self.head = None

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

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

    def remove(self, item):
        current = self.head
        previous = None
        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 length(self):
            current = self.head
            count = 0
            while current:
                count += 1
                current = current.getNext()
            return count

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

    def traverse(self):
        current = self.head
        while current:
            print(current.getData())
            current = current.getNext()
if __name__ == '__main__':
    mylist = UnorderedList()
    mylist.add(1)
    mylist.add(2)
    mylist.add(3)
    mylist.add(4)
    mylist.add(5)
    mylist.add(6)

    print(mylist.isEmpty())
    print(mylist.lenth())
    print("*" * 100)
    mylist.traverse()

False
6
****************************************************************************************************
6
5
4
3
2
1