






"""simple docstring"""







from __future__ import annotations


class    __UpperCAmelCase:




						"""simple docstring"""




						def __init__(       self	,  snake_case__      ):
												'''simple docstring'''
												lowercase__    :				List[Any]=	data
												lowercase__    :				Node | None=	None
												lowercase__    :				Node | None=	None





def 						lowercase__(A						)    ->None:  # In Order traversal of the tree




						"""simple docstring"""



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





def 						lowercase__(A						)    ->int:




						"""simple docstring"""



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





def 						lowercase__(A						)    ->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"""



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

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


if __name__ == "__main__":
			main()














"""simple docstring"""







from __future__ import annotations





def 						lowercase__(A ,		A						)    ->list[str]:




						"""simple docstring"""



						if partitions <= 0:
												raise ValueError("partitions must be a positive number!"						)
						if partitions > number_of_bytes:
												raise ValueError("partitions can not > number_of_bytes!"						)
						lowercase__    :				List[str]=	number_of_bytes // partitions
						lowercase__    :				Dict=	[]
						for i in range(A						):
												lowercase__    :				Union[str, Any]=	i * bytes_per_partition + 1
												lowercase__    :				Any=	(
												    number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
												)
												allocation_list.append(f'''{start_bytes}-{end_bytes}'''						)
						return allocation_list


if __name__ == "__main__":
			import doctest

			doctest.testmod()






