Vidyalelo
Data Structure · Q69

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 69

Q69

Choose the incorrect statement about DFS and BFS from the following?

A.
BFS is equivalent to level order traversal in trees
B.
DFS is equivalent to post order traversal in trees
Answer
C.
DFS and BFS code has the same time complexity
D.
BFS is implemented using queue

Answer: Option B

Solution

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