




from collections import namedtuple

UpperCAmelCase_									=	namedtuple('from_to', 'from_ to')

UpperCAmelCase_									=	{
    'cubicmeter': from_to(1, 1),
    'litre': from_to(0.001, 1_000),
    'kilolitre': from_to(1, 1),
    'gallon': from_to(0.0_0454, 264.172),
    'cubicyard': from_to(0.7_6455, 1.3_0795),
    'cubicfoot': from_to(0.028, 35.3147),
    'cup': from_to(0.0_0023_6588, 4226.75),
}




def 					lowerCamelCase__       (						A__       :					float  ,			A__       :					str  ,			A__       :					str	):





       '''simple docstring'''



       if from_type not in METRIC_CONVERSION:
              raise ValueError(
                  f'Invalid \'from_type\' value: {from_type!r}  Supported values are:\n'
                  + """, """.join(A__	)	)
       if to_type not in METRIC_CONVERSION:
              raise ValueError(
                  f'Invalid \'to_type\' value: {to_type!r}.  Supported values are:\n'
                  + """, """.join(A__	)	)
       return value * METRIC_CONVERSION[from_type].from_ * METRIC_CONVERSION[to_type].to


if __name__ == "__main__":
       import doctest

       doctest.testmod()



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()
