


import baseaa






def 							__lowercase       (			__lowerCAmelCase							:    str       ):
							return baseaa.baaencode(string.encode('utf-8'       )       )






def 							__lowercase       (			__lowerCAmelCase							:    bytes       ):
							return baseaa.baadecode(lowerCAmelCase__       ).decode('utf-8'       )


if __name__ == "__main__":
						snake_case					      =				'''Hello World!'''
						snake_case					      =				baseaa_encode(test)
						print(encoded)

						snake_case					      =				baseaa_decode(encoded)
						print(decoded)








from __future__ import annotations







class 	snake_case_       :
					def __init__(				self       :List[str]      ,__snake_case       :int				) ->   None:
												a__					=					data
												a__					=					None
												a__					=					None






def 							__lowercase       (			__lowerCAmelCase							:    Node | None       ):  # In Order traversal of the tree
							if tree:
														display(tree.left       )
														print(tree.data       )
														display(tree.right       )






def 							__lowercase       (			__lowerCAmelCase							:    Node | None       ):
							return 1 + max(depth_of_tree(tree.left       ) ,   depth_of_tree(tree.right       )       ) if tree else 0






def 							__lowercase       (			__lowerCAmelCase							:    Node       ):
							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 							__lowercase       (			):  # Main function for testing.
							a__					=					Node(1       )
							a__					=					Node(2       )
							a__					=					Node(3       )
							a__					=					Node(4       )
							a__					=					Node(5       )
							a__					=					Node(6       )
							a__					=					Node(7       )
							a__					=					Node(8       )
							a__					=					Node(9       )

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


if __name__ == "__main__":
						main()




