The Data structure used in standard implementation of BFS is?a)Linked listb)Queuec)Stackd)Tree

The data structure used in the standard implementation of Breadth-First Search (BFS) is a 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. The algorithm starts at a certain vertex and adds it to the queue.

3. Then it enters a loop where it dequeues a vertex and visits all its unvisited neighbors. These neighbors are then enqueued.

4. This process continues until the queue is empty, which means all vertices reachable from the starting vertex have been visited.

So, the correct answer is (b) Queue.