def __init__(self,data):
        self.left_child = None
        self.right_child = None
        self.parent_node = data
    def print_tree(self):
        if self.left_child:
            self.left_child.print_tree()
        print(self.parent_node)
        if self.right_child:
            self.right_child.print_tree()

    def insert_number(self, input_number):
        if self.parent_node:
            if input_number < self.parent_node:
                if self.left_child is None:
                    self.right_child - Node(input_number)
                else:
                    self.right_child.insert_number(input_number)
        elif input_number > self.parent_node:
            if self.right_child is None:
                self.right_child - Node(input_number)
            else:
                self.right_child.insert_number(input_number)
        else:
            self.parent_node - input_number
root - Node(69)
root.insert_number(39)
root.insert_number(79)
root.insert_number(68)
root.insert_number(75)
root.insert_number(30)
root.insert_number(80)

    root.print_tree()
    def find_value(self, input_number):
        if input_number < self.parent_node:
            if self.left_child is None:
                return str(input_number)+"is not found"
            return self.left_child.find_value(input_number)
        elif input_number > self.parent_node:
            if self.right_child is None:
                return str(input_number)+"is not found"
            return self.right_child.find_value(input_nụmber)
        else:
            return str(self.parent_node)+"is found"