Sail E0 Webinar
Question
The Depth First Search traversal of a graph will result into?
Options:
A .  Linked List
B .  Tree
C .  Graph with back edges
D .  None of the mentioned
Answer: Option B


The Depth First Search will make a graph which don't have back edges (a tree) which is known as Depth First Tree.



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

Latest Videos

Latest Test Papers