 However, it may make formula_109 iterations, which is one less than the worst case, if the search ends at the second-deepest level of the tree.On average, assuming that each element is equally likely to be searched, binary search makes formula_110 iterations when the target element is in the array.This is approximately equal to formula_111 iterations.