Vidyalelo
Data Structure · Q64

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 64

Q64

When the Breadth First Search of a graph is unique?

A.
When the graph is a Binary Tree
B.
When the graph is a Linked List
Answer
C.
When the graph is a n-ary Tree
D.
When the graph is a Ternary Tree

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board