def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       int ,     __UpperCamelCase    :       int	)							->					int:







  """simple docstring"""





  return int(input_a == input_a == 0	)



def 	__SCREAMING_SNAKE_CASE  (					)							->					None:







  """simple docstring"""





  print("""Truth Table of NOR Gate:"""	)
  print("""|   Input 1   |  Input 2  | Output |"""	)
  print(f"""|      0      |    0      |  {nor_gate(0 ,     0	)}     |"""	)
  print(f"""|      0      |    1      |  {nor_gate(0 ,     1	)}     |"""	)
  print(f"""|      1      |    0      |  {nor_gate(1 ,     0	)}     |"""	)
  print(f"""|      1      |    1      |  {nor_gate(1 ,     1	)}     |"""	)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   main()


from __future__ import annotations





class       _snake_case					:







			def __init__(				self						,   _a		):
				__magic_name__		:		Optional[Any]	   =     data
				__magic_name__		:		Node | None	   =     None
				__magic_name__		:		Node | None	   =     None







def   lowerCAmelCase_						(					_snake_case      :  Node | None   )				->		None:  # In Order traversal of the tree







	'''simple docstring'''


	if tree:
		display(tree.left   )
		print(tree.data   )
		display(tree.right   )






def   lowerCAmelCase_						(					_snake_case      :  Node | None   )				->		int:







	'''simple docstring'''


	return 1 + max(depth_of_tree(tree.left   )      ,   depth_of_tree(tree.right   )   ) if tree else 0






def   lowerCAmelCase_						(					_snake_case      :  Node   )				->		bool:







	'''simple docstring'''


	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.







	'''simple docstring'''


	__magic_name__		:		int	   =     Node(1   )
	__magic_name__		:		Union[str, Any]	   =     Node(2   )
	__magic_name__		:		Tuple	   =     Node(3   )
	__magic_name__		:		Optional[Any]	   =     Node(4   )
	__magic_name__		:		Union[str, Any]	   =     Node(5   )
	__magic_name__		:		Any	   =     Node(6   )
	__magic_name__		:		int	   =     Node(7   )
	__magic_name__		:		List[str]	   =     Node(8   )
	__magic_name__		:		Union[str, Any]	   =     Node(9   )

	print(is_full_binary_tree(_snake_case   )   )
	print(depth_of_tree(_snake_case   )   )
	print("Tree is: "   )
	display(_snake_case   )


if __name__ == "__main__":
				main()
