




"""simple docstring"""






from __future__ import annotations






class lowerCAmelCase__			:






			'''simple docstring'''



			def __init__(						self						,   lowercase						):
							_lowerCamelCase  :    str					=					data
							_lowerCamelCase  :    Node | None					=					None
							_lowerCamelCase  :    Node | None					=					None







def   _snake_case    (       lowercase__	):  # In Order traversal of the tree
				if tree:
								display(tree.left	)
								print(tree.data	)
								display(tree.right	)







def   _snake_case    (       lowercase__	):
				return 1 + max(depth_of_tree(tree.left	)							,					depth_of_tree(tree.right	)	) if tree else 0







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

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


if __name__ == "__main__":
			main()





"""simple docstring"""






def   _snake_case    (       lowercase__	):
				return "".join(chr(ord(lowercase__	) - 32	) if 'a' <= char <= 'z' else char for char in word	)


if __name__ == "__main__":
			from doctest import testmod

			testmod()