





"""simple docstring"""
from __future__ import annotations






class  _SCREAMING_SNAKE_CASE:




       def __init__(						self		,SCREAMING_SNAKE_CASE__							)      ->				None:





             """simple docstring"""






             __SCREAMING_SNAKE_CASE       :Union[str, Any]		    =  data
             __SCREAMING_SNAKE_CASE       :Node | None		    =  None
             __SCREAMING_SNAKE_CASE       :Node | None		    =  None




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



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



def 					__lowerCamelCase       (							a_					:		Node							)      ->				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 					__lowerCamelCase       (							)      ->				None:  # Main function for testing.
      __SCREAMING_SNAKE_CASE       :Optional[int]		    =  Node(1							)
      __SCREAMING_SNAKE_CASE       :int		    =  Node(2							)
      __SCREAMING_SNAKE_CASE       :Tuple		    =  Node(3							)
      __SCREAMING_SNAKE_CASE       :Union[str, Any]		    =  Node(4							)
      __SCREAMING_SNAKE_CASE       :List[str]		    =  Node(5							)
      __SCREAMING_SNAKE_CASE       :List[Any]		    =  Node(6							)
      __SCREAMING_SNAKE_CASE       :List[str]		    =  Node(7							)
      __SCREAMING_SNAKE_CASE       :Optional[int]		    =  Node(8							)
      __SCREAMING_SNAKE_CASE       :Tuple		    =  Node(9							)

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


if __name__ == "__main__":
  main()






"""simple docstring"""
def 					__lowerCamelCase       (							a_					:		str			,       a_					:		str							)      ->				str:
      __SCREAMING_SNAKE_CASE       :int		    =  len(a_							)
      __SCREAMING_SNAKE_CASE       :int		    =  len(a_							)
      __SCREAMING_SNAKE_CASE       :int		    =  (
          first_str_length if first_str_length > second_str_length else second_str_length
      )
      __SCREAMING_SNAKE_CASE       :list		    =  []
      for char_count in range(a_							):
            if char_count < first_str_length:
                  output_list.append(first_str[char_count]							)
            if char_count < second_str_length:
                  output_list.append(second_str[char_count]							)
      return "".join(a_							)


if __name__ == "__main__":
  print(alternative_string_arrange("AB", "XYZ"), end=" ")