'''simple docstring'''

from typing import Callable



def  _lowerCAmelCase				(				__a      )  ->      List[str]:
     '''simple docstring'''







     def wrapper(__a      ):
          _UpperCamelCase  :Dict       =function_with_docstring.__doc__
          return target_function

     return wrapper







from __future__ import annotations




class 							__A	:





				"""simple docstring"""







				def __init__(					self				,    lowerCamelCase__ = 0       ):




									"""simple docstring"""

									__UpperCamelCase :   str									=value
									__UpperCamelCase :   Node | None									=None
									__UpperCamelCase :   Node | None									=None






def 				A	(			a_				,a_   )	->		Node | None:
					if treea is None:
										return treea
					if treea is None:
										return treea

					__UpperCamelCase :   Dict									=treea.value + treea.value
					__UpperCamelCase :   Any									=merge_two_binary_trees(treea.left				,treea.left   )
					__UpperCamelCase :   Union[str, Any]									=merge_two_binary_trees(treea.right				,treea.right   )
					return treea






def 				A	(			a_   )	->		None:
					if root:
										print(root.value   )
										print_preorder(root.left   )
										print_preorder(root.right   )


if __name__ == "__main__":
							A_			:List[str]	    =		Node(1)
							A_			:Dict	    =		Node(2)
							A_			:str	    =		Node(3)
							A_			:Union[str, Any]	    =		Node(4)

							A_			:Any	    =		Node(2)
							A_			:Tuple	    =		Node(4)
							A_			:Optional[Any]	    =		Node(6)
							A_			:Optional[Any]	    =		Node(9)
							A_			:str	    =		Node(5)

							print('''Tree1 is: ''')
							print_preorder(treea)
							print('''Tree2 is: ''')
							print_preorder(treea)
							A_			:Optional[Any]	    =		merge_two_binary_trees(treea, treea)
							print('''Merged Tree is: ''')
							print_preorder(merged_tree)

