code: 
  
  
  
  
  
  class     __a						:
  
  
  
  
  
  
  
   def __init__(	self      :     List[Any]							,     SCREAMING_SNAKE_CASE      :     int		):
  
  
        '''simple docstring'''
  
  
  
  
  
  
        UpperCamelCase__    :     str        =						data
        UpperCamelCase__    :     BinaryTreeNode | None        =						None
        UpperCamelCase__    :     BinaryTreeNode | None        =						None
  
  
  
  
  
  
  
  def 	SCREAMING_SNAKE_CASE							(      __lowerCAmelCase      ,					__lowerCAmelCase    )				->			Any:
       if node is None:
            UpperCamelCase__    :     Optional[Any]        =						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:
            UpperCamelCase__    :     List[str]        =						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
            UpperCamelCase__    :     Dict        =						insert(node.right_child      ,					lowercase_    )
       return node
  
  
  
  
  
  
  
  def 	SCREAMING_SNAKE_CASE							(      __lowerCAmelCase    )				->			Optional[Any]:  # if node is None,return
       if node:
            UpperCamelCase__    :     Union[str, Any]        =						inorder(node.left_child    )
            UpperCamelCase__    :     Any        =						[*inorder_array, node.data]
            UpperCamelCase__    :     int        =						inorder_array + inorder(node.right_child    )
       else:
            UpperCamelCase__    :     Any        =						[]
       return inorder_array
  
  
  
  
  
  
  
  def 	SCREAMING_SNAKE_CASE							(      )				->			Tuple:
       UpperCamelCase__    :     List[Any]        =						insert(lowercase_      ,					15    )
       insert(lowercase_      ,					10    )
       insert(lowercase_      ,					25    )
       insert(lowercase_      ,					6    )
       insert(lowercase_      ,					14    )
       insert(lowercase_      ,					20    )
       insert(lowercase_      ,					60    )
       return root
  
  
  
  
  
  
  
  def 	SCREAMING_SNAKE_CASE							(      )				->			str:
       # main function
       UpperCamelCase__    :     Union[str, Any]        =						make_tree()
       print("Printing values of binary search tree in Inorder Traversal."    )
       inorder(lowercase_    )
  
  
  if __name__ == "__main__":
   import doctest
  
   doctest.testmod()
   main()
style_context: 
  
  
  
  
  
  
  from __future__ import annotations
  
  
  
  
  
  
  
  def 	SCREAMING_SNAKE_CASE							(      __lowerCAmelCase    )				->			list[int]:
       assert (
           isinstance(__lowerCAmelCase      ,					__lowerCAmelCase    ) and mask > 0
       ), f'mask needs to be positive integer, your input {mask}'
       UpperCamelCase__    :     Any        =						[]
       UpperCamelCase__    :     int        =						mask
  
       while submask:
            all_submasks.append(__lowerCAmelCase    )
            UpperCamelCase__    :     List[str]        =						(submask - 1) & mask
  
       return all_submasks
  
  
  if __name__ == "__main__":
   import doctest
  
   doctest.testmod()