Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node.

• A. True
• B. False