binary search tree recursive search code example

Example: recursive binary search python

def binary_search_recursive(A, key, low, high):
	if low > high:
		return False
	else:
		mid = (low + high) // 2
		if key == A[mid]:
			return True
		elif key < A[mid]:
			return binary_search_recursive(A, key, low, mid - 1)
		else:
			return binary_search_recursive(A, key, mid + 1, high)