Question

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

(c) When the graph is a n-ary Tree

(d) When the graph is a ternary Tree

This question was addressed to me in a national level competition.

The above asked question is from Depth First Search in portion Graph Search of Data Structures & Algorithms II

Answer 1

Correct choice is (b) When the graph is a Linked List

To explain: When Every node will have one successor then the Depth First Search is unique. In all other cases, when it will have more than one successor, it can choose any of them in arbitrary order.