 Starting from the root node, the left or right subtrees are traversed depending on whether the target value is less or more than the node under consideration.In the worst case, binary search makes formula_103 iterations of the comparison loop, where the formula_104 notation denotes the floor function that yields the greatest integer less than or equal to the argument, and formula_105 is the binary logarithm.This is because the worst case is reached when the search reaches the deepest level of the tree, and there are always formula_103 levels in the tree for any binary search.