Iterative Deepening Trade-offs

Iterative deepening combines DFS memory efficiency with BFS completeness and optimality.

Why is iterative deepening search often preferred over plain BFS for large uniform-cost search spaces?