






from collections import namedtuple

__UpperCAmelCase							:   List[str]							=  namedtuple("from_to", "from_ to")

__UpperCAmelCase							:   int							=  {
    "cubicmeter": from_to(1, 1),
    "litre": from_to(0.001, 1_0_0_0),
    "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 					lowercase_ (    __snake_case     :							float	,	__snake_case     :							str	,	__snake_case     :							str      )     -> float:





				'''simple docstring'''


				if from_type not in METRIC_CONVERSION:
								raise ValueError(
								    F'Invalid \'from_type\' value: {from_type!r}  Supported values are:\n'
								    + ", ".join(__snake_case      )      )
				if to_type not in METRIC_CONVERSION:
								raise ValueError(
								    F'Invalid \'to_type\' value: {to_type!r}.  Supported values are:\n'
								    + ", ".join(__snake_case      )      )
				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					,UpperCamelCase       )						->    None:
					snake_case__      :Union[str, Any]         =   data
					snake_case__      :Node | None         =   None
					snake_case__      :Node | None         =   None





def 					lowercase_ (    __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 					lowercase_ (    __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 					lowercase_ (    __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 					lowercase_ (    )     -> None:  # Main function for testing.





				'''simple docstring'''


				snake_case__      :Dict         =   Node(1      )
				snake_case__      :int         =   Node(2      )
				snake_case__      :Optional[Any]         =   Node(3      )
				snake_case__      :Tuple         =   Node(4      )
				snake_case__      :str         =   Node(5      )
				snake_case__      :Optional[Any]         =   Node(6      )
				snake_case__      :List[Any]         =   Node(7      )
				snake_case__      :List[str]         =   Node(8      )
				snake_case__      :Tuple         =   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()