Consider the tree arcs of a BFS traversal from a source node $W$ in an unweighted, connected, undirected graph. The tree $T$ formed by the tree arcs is a data structure for computing
For DFS, no option would be correct.
BFS always produces shortest path from source to all other vertices in an unweighted graph.
So - B