Topics

Data Structure Time Complexity

‹ Previous Next › Start Quiz - Time Complexity

⚠ Report ✓ Question Verified Copy Link

Q: What is the time complexity of a depth-first search (DFS) algorithm on a tree with N nodes?

A O(1)
B O(log N)
C O(N)
D O(N^2)
Share this MCQ

‹ Previous Next ›

Write your comment

Learn More MCQ Questions from Data Structure Time Complexity