






def 			__lowerCamelCase     (						snake_case__			,snake_case__						)				->    int:






						"""simple docstring"""





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

def 			__lowerCamelCase     (						snake_case__			,snake_case__			,snake_case__			,snake_case__						)				->    int:






						"""simple docstring"""





						if not (0 <= high < len(snake_case__						) and 0 <= low < len(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(snake_case__			,low + 1			,high - 1			,snake_case__						)


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

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









def 			__lowerCamelCase     (						snake_case__			,snake_case__						)				->    Dict:






						"""simple docstring"""





						if not root or root not in binary_tree_mirror_dictionary:
												return
						_SCREAMING_SNAKE_CASE ,	_SCREAMING_SNAKE_CASE       =    binary_tree_mirror_dictionary[root][:2]
						_SCREAMING_SNAKE_CASE       =    [right_child, left_child]
						binary_tree_mirror_dict(snake_case__			,snake_case__						)
						binary_tree_mirror_dict(snake_case__			,snake_case__						)

def 			__lowerCamelCase     (						snake_case__			,snake_case__ = 1						)				->    dict:






						"""simple docstring"""





						if not binary_tree:
												raise ValueError("""binary tree cannot be empty"""						)
						if root not in binary_tree:
												_SCREAMING_SNAKE_CASE       =    F'root {root} is not present in the binary_tree'
												raise ValueError(snake_case__						)
						_SCREAMING_SNAKE_CASE       =    dict(snake_case__						)
						binary_tree_mirror_dict(snake_case__			,snake_case__						)
						return binary_tree_mirror_dictionary


if __name__ == "__main__":
		UpperCamelCase												=      {1: [2, 3], 2: [4, 5], 3: [6, 7], 7: [8, 9]}
		print(f"Binary tree: {binary_tree}")
		UpperCamelCase												=      binary_tree_mirror(binary_tree, 5)
		print(f"Binary tree mirror: {binary_tree_mirror_dictionary}")

