Vidyalelo
Data Structure · Q67

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 67

Q67

Depth First Search is equivalent to which of the traversal in the Binary Trees?

A.
Pre-order Traversal
Answer
B.
Post-order Traversal
C.
Level-order Traversal
D.
In-order Traversal

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Graph Algorithms (DFS, BFS, Dijkstras, etc) questions