

def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					str    ):



     '''simple docstring'''





     return -num if num < 0 else num

def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					List[str]    ):



     '''simple docstring'''





     if len(SCREAMING_SNAKE_CASE_    ) == 0:
          raise ValueError('abs_min() arg is an empty sequence'    )
     lowercase__					:     Union[str, Any]   = x[0]
     for i in x:
          if abs_val(SCREAMING_SNAKE_CASE_    ) < abs_val(SCREAMING_SNAKE_CASE_    ):
               lowercase__					:     List[Any]   = i
     return j

def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					List[str]    ):



     '''simple docstring'''





     if len(SCREAMING_SNAKE_CASE_    ) == 0:
          raise ValueError('abs_max() arg is an empty sequence'    )
     lowercase__					:     str   = x[0]
     for i in x:
          if abs(SCREAMING_SNAKE_CASE_    ) > abs(SCREAMING_SNAKE_CASE_    ):
               lowercase__					:     Dict   = i
     return j

def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					Union[str, Any]    ):



     '''simple docstring'''





     if len(SCREAMING_SNAKE_CASE_    ) == 0:
          raise ValueError('abs_max_sort() arg is an empty sequence'    )
     return sorted(SCREAMING_SNAKE_CASE_			,  key=SCREAMING_SNAKE_CASE_    )[-1]

def 			snake_case__    (					):



     '''simple docstring'''





     assert abs_val(0    ) == 0
     assert abs_val(34    ) == 34
     assert abs_val(-100_000_000_000    ) == 100_000_000_000

     lowercase__					:     List[Any]   = [-3, -1, 2, -11]
     assert abs_max(SCREAMING_SNAKE_CASE_    ) == -11
     assert abs_max_sort(SCREAMING_SNAKE_CASE_    ) == -11
     assert abs_min(SCREAMING_SNAKE_CASE_    ) == -1


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  test_abs_val()
  print(abs_val(-34))  # --> 34




from __future__ import annotations


class    SCREAMING_SNAKE_CASE__      :





    def __init__(   self		,     a = 0):
         lowercase__					:     int   = value
         lowercase__					:     Node | None   = None
         lowercase__					:     Node | None   = None



def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					Node | None			,  SCREAMING_SNAKE_CASE_	:					Node | None    ):



     '''simple docstring'''





     if treea is None:
          return treea
     if treea is None:
          return treea

     lowercase__					:     Optional[Any]   = treea.value + treea.value
     lowercase__					:     Union[str, Any]   = merge_two_binary_trees(treea.left			,  treea.left    )
     lowercase__					:     Optional[Any]   = merge_two_binary_trees(treea.right			,  treea.right    )
     return treea

def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					Node | None    ):



     '''simple docstring'''





     if root:
          print(root.value    )
          print_preorder(root.left    )
          print_preorder(root.right    )


if __name__ == "__main__":
       snake_case_    						=				Node(1)
       snake_case_    						=				Node(2)
       snake_case_    						=				Node(3)
       snake_case_    						=				Node(4)

       snake_case_    						=				Node(2)
       snake_case_    						=				Node(4)
       snake_case_    						=				Node(6)
       snake_case_    						=				Node(9)
       snake_case_    						=				Node(5)

       print('''Tree1 is: ''')
       print_preorder(treea)
       print('''Tree2 is: ''')
       print_preorder(treea)
       snake_case_    						=				merge_two_binary_trees(treea, treea)
       print('''Merged Tree is: ''')
       print_preorder(merged_tree)

