If the graph is supposed to have a vertex cover of size at most K, then the maximum number of levels that we can go down here is actually K levels, so for the decision variant, what we have here is that the height of the search tree is no longer in half, but it's actually bounded by K, and K is the size of the vertex cover that we're looking for. 