Basic implementation of singly linked list

SinglyLinkedList.py

# Basic implementation of singly linked list
class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

    def getData(self):
        return self.data

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

    def getNext(self):
        return self.next

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


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

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

    def size(self):
        curr = self.head
        size = 0
        while curr:
            size += 1
            curr = curr.getNext
        return size

    def find(self, data):
        curr = self.head
        found = False
        while curr is not None and not found:
            if curr.getData() == data:
                found = True
            else:
                curr = curr.getNext()
        if curr is None:
            return False
        return curr

    def append(self, data):
        newNode = Node(data)
        if self.head == Node:
            self.head = newNode
        else:
            newNode.setNext(self.head)
            self.head = newNode
            self.size += 1

    def remove(self, data):
        curr = self.head
        prev = None
        found = False
        while curr and found is False:
            if curr.getData() == data:
                found = True:
            else:
                prev = curr
                curr = curr.getNext()
        if curr is None:
            return False
        if prev is None:
            self.head = curr.getNext()
        else:
            prev.setNext(curr.getNext())