What would be the time complexity of the BFS traversal of a graph with n vertices and n1.25 edges?

Explore topic-wise MCQs in Data Structure Questions and Answers.

This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.

1.	What would be the time complexity of the BFS traversal of a graph with n vertices and n1.25 edges?
A.	O(n)
B.	O(n1.25)
C.	O(n2.25)
D.	O(n*n)
Answer» C. O(n2.25)

Discussion