class 							a_					:






 '''simple docstring'''






 def __init__(     self   :    Union[str, Any]     ,       lowercase__   :    Any):







        '''simple docstring'''



        lowerCAmelCase__	      =   data
        lowerCAmelCase__	      =   None
        lowerCAmelCase__	      =   None






def  __lowerCamelCase						(		lowerCAmelCase__      ,    lowerCAmelCase__      ):





       if node is None:
              lowerCAmelCase__	      =   BinaryTreeNode(lowercase__      )
              return node

       # binary search tree is not empty,
       # so we will insert it into the tree
       # if new_value is less than value of data in node,
       #  add it to left subtree and proceed recursively
       if new_value < node.data:
              lowerCAmelCase__	      =   insert(node.left_child      ,    lowercase__      )
       else:
              # if new_value is greater than value of data in node,
              #  add it to right subtree and proceed recursively
              lowerCAmelCase__	      =   insert(node.right_child      ,    lowercase__      )
       return node






def  __lowerCamelCase						(		lowerCAmelCase__      ):  # if node is None,return





       if node:
              lowerCAmelCase__	      =   inorder(node.left_child      )
              lowerCAmelCase__	      =   [*inorder_array, node.data]
              lowerCAmelCase__	      =   inorder_array + inorder(node.right_child      )
       else:
              lowerCAmelCase__	      =   []
       return inorder_array






def  __lowerCamelCase						(		):
       lowerCAmelCase__	      =   insert(lowercase__      ,    1_5      )
       insert(lowercase__      ,    1_0      )
       insert(lowercase__      ,    2_5      )
       insert(lowercase__      ,    6      )
       insert(lowercase__      ,    1_4      )
       insert(lowercase__      ,    2_0      )
       insert(lowercase__      ,    6_0      )
       return root






def  __lowerCamelCase						(		):
       lowerCAmelCase__	      =   make_tree()
       print('Printing values of binary search tree in Inorder Traversal.'      )
       inorder(lowercase__      )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    main()





def    UpperCAmelCase					(  lowercase__						:					int = 998001	):



			'''simple docstring'''





			for number in range(n - 1				,					9999				,					-1	):
						a__					=  str(lowercase__	)

						# checks whether 'str_number' is a palindrome.
						if str_number == str_number[::-1]:
									a__					=  999

									# if 'number' is a product of two 3-digit numbers
									# then number is the answer otherwise fetch next number.
									while divisor != 99:
												if (number % divisor == 0) and (len(str(number // divisor	)	) == 3.0):
															return number
												divisor -= 1
			raise ValueError("""That number is larger than our acceptable range."""	)


if __name__ == "__main__":
	print(f'''{solution() = }''')

