BFS visits the parent nodes before visiting the child nodes, and a queue is used in the search process.
BFS visits the parent nodes before. BFS is visiting the child nodes. A queue is used in the search process.