def search(self, data):
    currentNode = self.head
    if (currentNode.data == data):
        return currentNode
    while (currentNode.next is not Node):
        if (currentNode.next.data == data):
            return currentNode.next
        currentNode = currentNode.next
    return None
def search(self, data):
    currentNode = self.head
    if (currentNode.data == data):
        return currentNode
    while (currentNode.next is not Node):
        if (currentNode.next.data == data):
            return currentNode.next
        currentNode = currentNode.next
    return None