



'''simple docstring'''







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE     ):
		return int(SCREAMING_SNAKE_CASE     ) if x - int(SCREAMING_SNAKE_CASE     ) >= 0 else int(SCREAMING_SNAKE_CASE     ) - 1


if __name__ == "__main__":
							import doctest

							doctest.testmod()





from __future__ import annotations

class 			__snake_case   :







							'''simple docstring'''






							def __init__(				self	,	a_ = 0		):
											a__					   =		value
											a__					   =		None
											a__					   =		None




def       A_   (						__a  :					Node | None			,		__a  :					Node | None		):

				"""simple docstring"""
				if treea is None:
								return treea
				if treea is None:
								return treea

				a__					   =		treea.value + treea.value
				a__					   =		merge_two_binary_trees(treea.left			,		treea.left		)
				a__					   =		merge_two_binary_trees(treea.right			,		treea.right		)
				return treea

def       A_   (						__a  :					Node | None		):

				"""simple docstring"""
				if root:
								print(root.value		)
								print_preorder(root.left		)
								print_preorder(root.right		)


if __name__ == "__main__":
	UpperCAmelCase							=       Node(1)
	UpperCAmelCase							=       Node(2)
	UpperCAmelCase							=       Node(3)
	UpperCAmelCase							=       Node(4)

	UpperCAmelCase							=       Node(2)
	UpperCAmelCase							=       Node(4)
	UpperCAmelCase							=       Node(6)
	UpperCAmelCase							=       Node(9)
	UpperCAmelCase							=       Node(5)

	print("""Tree1 is: """)
	print_preorder(treea)
	print("""Tree2 is: """)
	print_preorder(treea)
	UpperCAmelCase							=       merge_two_binary_trees(treea, treea)
	print("""Merged Tree is: """)
	print_preorder(merged_tree)

