 The average case for successful searches is the number of iterations required to search every element exactly once, divided by formula_2, the number of elements.The average case for unsuccessful searches is the number of iterations required to search an element within every interval exactly once, divided by the formula_118 intervals.In the binary tree representation, a successful search can be represented by a path from the root to the target node, called an "internal path".