



'''simple docstring'''





from __future__ import annotations






class 					lowerCamelCase_    :
  """simple docstring"""




  def __init__( self      :	Tuple			,	_a      :	int   )					->					None:
    __lowerCamelCase       :       Union[str, Any]           = data
    __lowerCamelCase       :       Node | None           = None
    __lowerCamelCase       :       Node | None           = None




def        a_     (							_lowerCAmelCase       )      ->      None:  # In Order traversal of the tree
  if tree:
    display(tree.left       )
    print(tree.data       )
    display(tree.right       )

def        a_     (							_lowerCAmelCase       )      ->      int:
  return 1 + max(depth_of_tree(tree.left       )       ,depth_of_tree(tree.right       )       ) if tree else 0

def        a_     (							_lowerCAmelCase       )      ->      bool:
  if not tree:
    return True
  if tree.left and tree.right:
    return is_full_binary_tree(tree.left       ) and is_full_binary_tree(tree.right       )
  else:
    return not tree.left and not tree.right

def        a_     (							)      ->      None:  # Main function for testing.
  __lowerCamelCase       :       int           = Node(1       )
  __lowerCamelCase       :       Dict           = Node(2       )
  __lowerCamelCase       :       Optional[int]           = Node(3       )
  __lowerCamelCase       :       str           = Node(4       )
  __lowerCamelCase       :       Dict           = Node(5       )
  __lowerCamelCase       :       int           = Node(6       )
  __lowerCamelCase       :       Optional[int]           = Node(7       )
  __lowerCamelCase       :       Union[str, Any]           = Node(8       )
  __lowerCamelCase       :       Optional[Any]           = Node(9       )

  print(is_full_binary_tree(_lowerCAmelCase       )       )
  print(depth_of_tree(_lowerCAmelCase       )       )
  print('Tree is: '       )
  display(_lowerCAmelCase       )


if __name__ == "__main__":
   main()











'''simple docstring'''





def        a_     (							_lowerCAmelCase       )      ->      list:
  if n_term == "":
    return []
  __lowerCamelCase       :       list           = []
  for temp in range(int(_lowerCAmelCase       )       ):
    series.append(F'1/{temp + 1}' if series else '1'       )
  return series


if __name__ == "__main__":
   _UpperCamelCase											=						input('Enter the last number (nth term) of the Harmonic Series')
   print('Formula of Harmonic Series => 1+1/2+1/3 ..... 1/n')
   print(harmonic_series(nth_term))






