a) Pre-order Traversal
b) Post-order Traversal
c) Level-order Traversal
d) In-order Traversal
In Depth First Search, we explore all the nodes aggressively to one path and then backtrack to the node. Hence, it is equivalent to the pre-order traversal of a Binary Tree.
a) O(V + E)
b) O(V)
c) O(E)
d) O(V*E)
The Depth First Search explores every node once and every edge once (in worst case), so it’s time complexity is O(V + E).
a) Stack
b) Queue
c) Linked List
d) Tree
The Depth First Search is implemented using recursion. So, stack can be used as data structure to implement depth first search.
a) Linked List
b) Tree
c) Graph with back edges
d) Array
The Depth First Search will make a graph which don’t have back edges (a tree) which is known as Depth First Tree.
a) Depth First Search
b) Breadth First Search
c) Trim’s algorithm
d) Kruskal’s Algorithm
This is the definition of the Depth First Search. Exploring a node, then aggressively finding nodes till it is not able to find any node.
Items per page: