What will be the time complexity of the iterative depth first travers – 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

Choose the incorrect statement about DFS and BFS from the following?
Which of the following data structure is used to implement BFS?
What is the space complexity of standard DFS(V: no. of vertices E: no. of edges)?
What will be the time complexity of the iterative depth first traversal code(V=no. of vertices E=no.of edges)?
Which of the following is a possible result of depth first traversal of the given graph(consider 1 to be source element)?
What will be the result of depth first traversal in the following tree?
Which of the following traversal in a binary tree is similar to depth first traversal?
Which of the following data structure is used to implement DFS?