
def  UpperCamelCase					(							lowerCAmelCase__				,    lowerCAmelCase__	):
					'''simple docstring'''
					return int((input_a, input_a).count(0	) == 0	)



def  UpperCamelCase					(							):
					'''simple docstring'''
					assert and_gate(0				,    0	) == 0
					assert and_gate(0				,    1	) == 0
					assert and_gate(1				,    0	) == 0
					assert and_gate(1				,    1	) == 1


if __name__ == "__main__":
							test_and_gate()
							print(and_gate(1, 0))
							print(and_gate(0, 0))
							print(and_gate(0, 1))
							print(and_gate(1, 1))






class        lowercase	:




							def __init__(       self     ,A__):
												lowercase					=		val
												lowercase					=		None
												lowercase					=		None





							def 				A__   (       self     ,A__):
												if self.val:
																	if val < self.val:
																						if self.left is None:
																											lowercase					=		Node(A__)
																						else:
																											self.left.insert(A__)
																	elif val > self.val:
																						if self.right is None:
																											lowercase					=		Node(A__)
																						else:
																											self.right.insert(A__)
												else:
																	lowercase					=		val



def  UpperCamelCase					(							lowerCAmelCase__				,    lowerCAmelCase__	):
					'''simple docstring'''
					# Recursive traversal
					if root:
										inorder(root.left				,    lowerCAmelCase__	)
										res.append(root.val	)
										inorder(root.right				,    lowerCAmelCase__	)



def  UpperCamelCase					(							lowerCAmelCase__	):
					'''simple docstring'''
					# Build BST
					if len(lowerCAmelCase__	) == 0:
										return arr
					lowercase					=		Node(arr[0]	)
					for i in range(1				,    len(lowerCAmelCase__	)	):
										root.insert(arr[i]	)
					# Traverse BST in order.
					lowercase					=		[]
					inorder(lowerCAmelCase__				,    lowerCAmelCase__	)
					return res


if __name__ == "__main__":
							print(tree_sort([10, 1, 3, 2, 9, 14, 13]))




