 The comparison tree representing binary search has the fewest levels possible as every level above the lowest level of the tree is filled completely.Otherwise, the search algorithm can eliminate few elements in an iteration, increasing the number of iterations required in the average and worst case.This is the case for other search algorithms based on comparisons, as while they may work faster on some target values, the average performance over "all" elements is worse than binary search.