





from __future__ import annotations





class UpperCAmelCase_							:


  def __init__(       self   ,__snake_case   ):



       """simple docstring"""





       A_					      =					value
       A_					      =					None
       A_					      =					None





class UpperCAmelCase_							:
  __lowerCAmelCase      :	int


  def __init__(       self   ):



       """simple docstring"""





       A_					      =					0


  def 	__UpperCAmelCase    (       self   ,__snake_case   ,__snake_case   ):



       """simple docstring"""





       if node is None:
            return

       if path_sum == self.target:
            self.paths += 1

       if node.left:
            self.depth_first_search(node.left   ,path_sum + node.left.value   )
       if node.right:
            self.depth_first_search(node.right   ,path_sum + node.right.value   )




  def 	__UpperCAmelCase    (       self   ,__snake_case   ,__snake_case = None   ):



       """simple docstring"""





       if node is None:
            return 0
       if target is not None:
            A_					      =					target

       self.depth_first_search(__snake_case   ,node.value   )
       self.path_sum(node.left   )
       self.path_sum(node.right   )

       return self.paths


if __name__ == "__main__":
      import doctest

      doctest.testmod()










from __future__ import annotations

def     UpperCAmelCase_						(						_UpperCAmelCase       :list[int | float]							)  ->							int | float:
     '''simple docstring'''


     if len(_UpperCAmelCase							) == 0:
          raise ValueError('''find_max() arg is an empty sequence'''							)
     A_					      =					nums[0]
     for x in nums:
          if x > max_num:
               A_					      =					x
     return max_num


if __name__ == "__main__":
      import doctest

      doctest.testmod(verbose=True)



