The Data structure used in standard implementation of BFS is?a)Stackb)Linked listc)Queued)Tree

The data structure used in the standard implementation of Breadth-First Search (BFS) is c) Queue.

Here's why:

1. BFS is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order, i.e., it explores all the vertices at the current level before moving on to the vertices at the next level.

2. To achieve this, BFS uses a queue data structure.

3. Initially, the source vertex is visited and enqueued.

4. Then, while the queue is not empty, the following steps are performed:

   • The vertex at the front of the queue is dequeued and visited.
   • All unvisited neighbors of this vertex are visited and enqueued.

5. This process continues until the queue is empty, i.e., all vertices reachable from the source vertex have been visited.

6. Therefore, the queue data structure is used in the standard implementation of BFS to keep track of the vertices to be visited.