What will be the time complexity of the iterative depth first traversa – McqOptions

MCQOPTIONS

1.	What will be the time complexity of the iterative depth first traversal code(V=no. of vertices E=no.of edges)?
A.	O(V+E)
B.	O(V)
C.	O(E)
D.	O(V*E)
Answer» B. O(V)

Discussion

No Comment Found

Related MCQs

In Depth First Search, how many times a node is visited?
Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
In BFS, how many times a node is visited?
Time Complexity of DFS is? (V - number of vertices, E - number of edges)
Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)
What will be the result of depth first traversal in the following tree?
Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1)
What is the space complexity of standard DFS(V: no. of vertices E: no. of edges)?
Choose the incorrect statement about DFS and BFS from the following?
Which of the following is a possible result of depth first traversal of the given graph(consider 1 to be source element)?