they were placed in the queue -- not when they were removed from the queue. <span>An alternative would be to mark a node as processed </span><em>after</em><span>&nbsp;it's pulled out of the queue. In that case, every time you pull a node out of the queue, you'd check whether it was processed already and print it out only in the case where it was unprocessed. What is the big downside to implementing the algorithm that way? (Hint: Trace through both of these approaches to BFS using a <strong>complete graph</s