
'''simple docstring'''





import importlib.metadata
import subprocess
import sys





def 							snake_case				(		UpperCAmelCase = False						)->      Union[str, Any]:







      """simple docstring"""
      __A													=      False
      if "IPython" in sys.modules:
            __A													=      'google.colab' in str(sys.modules['IPython'].get_ipython()						)

      if in_colab:
            if upgrade:
                  __A													=      ['pip', 'install', '-U', 'torch']
                  subprocess.run(UpperCAmelCase   ,	check=UpperCAmelCase						)
            # get the current version of torch
            __A													=      importlib.metadata.version('torch'						)
            __A													=      torch_version[: torch_version.rindex('.'						)]
            __A													=      f'https://storage.googleapis.com/tpu-pytorch/wheels/colab/torch_xla-{torch_version_trunc}-cp37-cp37m-linux_x86_64.whl'
            __A													=      ['pip', 'install', xla_wheel]
            subprocess.run(UpperCAmelCase   ,	check=UpperCAmelCase						)
      else:
            raise RuntimeError('`install_xla` utility works only on google colab.'						)








'''simple docstring'''





class 			UpperCamelCase__	:






 def __init__(      self	:Tuple						,					_A	:int      )					->      None:







       '''simple docstring'''



       __A													=      data
       __A													=      None
       __A													=      None





def 							snake_case				(		UpperCAmelCase   ,	UpperCAmelCase						)->      BinaryTreeNode | None:







      """simple docstring"""
      if node is None:
            __A													=      BinaryTreeNode(UpperCAmelCase						)
            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:
            __A													=      insert(node.left_child   ,	UpperCAmelCase						)
      else:
            # if new_value is greater than value of data in node,
            #  add it to right subtree and proceed recursively
            __A													=      insert(node.right_child   ,	UpperCAmelCase						)
      return node





def 							snake_case				(		UpperCAmelCase						)->      list[int]:  # if node is None,return







      """simple docstring"""
      if node:
            __A													=      inorder(node.left_child						)
            __A													=      [*inorder_array, node.data]
            __A													=      inorder_array + inorder(node.right_child						)
      else:
            __A													=      []
      return inorder_array





def 							snake_case				(		)->      BinaryTreeNode | None:







      """simple docstring"""
      __A													=      insert(UpperCAmelCase   ,	1_5						)
      insert(UpperCAmelCase   ,	1_0						)
      insert(UpperCAmelCase   ,	2_5						)
      insert(UpperCAmelCase   ,	6						)
      insert(UpperCAmelCase   ,	1_4						)
      insert(UpperCAmelCase   ,	2_0						)
      insert(UpperCAmelCase   ,	6_0						)
      return root





def 							snake_case				(		)->      None:







      """simple docstring"""
      # main function
      __A													=      make_tree()
      print('Printing values of binary search tree in Inorder Traversal.'						)
      inorder(UpperCAmelCase						)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()






