def search(self,value):
        if self.root != None:
            return self._search(value, self.root)
        else:
            return None

    def _search(self, value, curent_node):
        if value == self.root.value:
            return none
        elif value == curent_node.value:
            return curent_node.parent.value
        elif value < curent_node.value and curent_node.left_child != None:
            return self._search(value, curent_node.left_child)
        elif value > curent_node.value and curent_node.right_child != None:
            return self._search(value, curent_node.right_child)


    def find(self, value):
        if self.root != None:
            return self._find(value, self.root)
        else:
            return None

    def _find(self, value, curent_node):
        if value == curent_node.value:
            return curent_node
        elif value < curent_node.value and curent_node.left_child != None:
            return self._find(value, curent_node.left_child)
        elif value > curent_node.value and curent_node.right_child != None:
            return self._find(value, curent_node.right_child)