In this paper we continue the line of work initiated in “Building iteration trees”. It is shown that the existence of a certain kind of iteration tree of height ω is equivalent to the existence of a cardinal δ that is Woodin with respect to functions in the next admissible.