
'''simple docstring'''

from __future__ import annotations







class 	__lowerCAmelCase    :



     def __init__(self						,	lowerCAmelCase__ = 0	):
          _UpperCAmelCase					:  Tuple         =    value
          _UpperCAmelCase					:  Node | None         =    None
          _UpperCAmelCase					:  Node | None         =    None







def __A  (    lowerCAmelCase_ ,       lowerCAmelCase_       ):
     if treea is None:
          return treea
     if treea is None:
          return treea

     _UpperCAmelCase					:  Optional[Any]         =    treea.value + treea.value
     _UpperCAmelCase					:  Any         =    merge_two_binary_trees(treea.left ,       treea.left       )
     _UpperCAmelCase					:  Optional[Any]         =    merge_two_binary_trees(treea.right ,       treea.right       )
     return treea







def __A  (    lowerCAmelCase_       ):
     if root:
          print(root.value       )
          print_preorder(root.left       )
          print_preorder(root.right       )


if __name__ == "__main__":
   lowerCAmelCase_			:			Union[str, Any]			   =     Node(1)
   lowerCAmelCase_			:			Union[str, Any]			   =     Node(2)
   lowerCAmelCase_			:			Tuple			   =     Node(3)
   lowerCAmelCase_			:			Any			   =     Node(4)

   lowerCAmelCase_			:			List[str]			   =     Node(2)
   lowerCAmelCase_			:			str			   =     Node(4)
   lowerCAmelCase_			:			Dict			   =     Node(6)
   lowerCAmelCase_			:			List[Any]			   =     Node(9)
   lowerCAmelCase_			:			Tuple			   =     Node(5)

   print('''Tree1 is: ''')
   print_preorder(treea)
   print('''Tree2 is: ''')
   print_preorder(treea)
   lowerCAmelCase_			:			Dict			   =     merge_two_binary_trees(treea, treea)
   print('''Merged Tree is: ''')
   print_preorder(merged_tree)





'''simple docstring'''
def       a__    (  _SCREAMING_SNAKE_CASE					:    list     ,							_SCREAMING_SNAKE_CASE					:    int							)			-> int:


	"""simple docstring"""





	for index, item in enumerate(_SCREAMING_SNAKE_CASE							):
		if item == target:
			return index
	return -1


def       a__    (  _SCREAMING_SNAKE_CASE					:    list     ,							_SCREAMING_SNAKE_CASE					:    int     ,							_SCREAMING_SNAKE_CASE					:    int     ,							_SCREAMING_SNAKE_CASE					:    int							)			-> int:


	"""simple docstring"""





	if not (0 <= high < len(_SCREAMING_SNAKE_CASE							) and 0 <= low < len(_SCREAMING_SNAKE_CASE							)):
		raise Exception("Invalid upper or lower bound!"							)
	if high < low:
		return -1
	if sequence[low] == target:
		return low
	if sequence[high] == target:
		return high
	return rec_linear_search(_SCREAMING_SNAKE_CASE     ,							low + 1     ,							high - 1     ,							_SCREAMING_SNAKE_CASE							)


if __name__ == "__main__":
					_lowerCamelCase	 =			input("""Enter numbers separated by comma:\n""").strip()
					_lowerCamelCase	 =			[int(item.strip()) for item in user_input.split(""",""")]

					_lowerCamelCase	 =			int(input("""Enter a single number to be found in the list:\n""").strip())
					_lowerCamelCase	 =			linear_search(sequence, target)
					if result != -1:
										print(f"""linear_search({sequence}, {target}) = {result}""")
					else:
										print(f"""{target} was not found in {sequence}""")




