Which statement about Breadth-First Search is correct?

A. every level is completely filled B. it may examine every element C. it typically uses a queue D. collisions must be handled when keys map to the same position