1.

Worst case complexity of Breadth First Search traversal __________

A. O(n*n)
B. O(nlogn)
C. O(n² logn)
D. O(n³)
Answer» C. O(n² logn)


Discussion

No Comment Found

Related MCQs