Q77
When the Depth First Search of a graph is unique?
A.
When the graph is a Binary Tree
B.
When the graph is a Linked List
AnswerC.
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