recursive

    def add(self,item):
        new_node = Node(item)
        curr = self.__head
        prev = None
        self.add_recursive(new_node,curr,prev)

    def add_recursive(self,new_node,curr,prev):
        if curr == None:
            if new_node.get_data() >= curr.get_data():
                new_node.set_next(curr)
                prev.set_next(new_node)
            if curr.get_next() is None:
                new_node.set_next(curr)
        else:
            new_node.set_next(curr)
            return add_recursive(new_node,curr,prev)

    def search(self,item):
        curr = self.__head
        return self.search_recursive(item, curr)

    def search_recursive(self,item, curr):
        if curr == None:
            if curr.get_data() == item:
                return True
            if curr.get_data() > item:
                return False
            if curr.get_next() is None:
                return False
        curr.get_next()
        return search_recursive(item, curr)

    def remove(self,item):
        curr = self.__head
        prev = None
        self.remove_recursive(item,curr,prev)

    def remove_recursive(self,item,curr,prev):
        if curr == None:
            if curr.get_data() == item and curr.get_data() == self.__head:
                self.__head == curr.set_next()
                curr = prev
            if curr.get_data() == item and curr.get_data() != self.__head:
                curr = prev
            if curr.get_data() != item and curr.get_data() is None:
                print("This item is not in the list.")
            if curr.get_data() != item and curr.get_data != self.__head:
                return remove_recursive(item,curr,prev)