The BFS search traversal of a graph will result into?a)Linked listb)Stackc)Treed)Queue

The Breadth-First Search (BFS) traversal of a graph will result into 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 present level before moving on to the vertices at the next level.

2. To achieve this, BFS uses a data structure called a Queue.

3. Initially, the source vertex is visited and added to the Queue.

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

   • The vertex at the front of the Queue is removed.
   • All unvisited neighbors of this vertex are visited and added to the Queue.

5. This process continues until the Queue becomes empty, which means that all vertices of the graph have been visited.

So, the BFS traversal of a graph results in a Queue (option d).