..:: Trees on Data Structure and Algorithms related Questions and Answers

Question : What is the time complexity of Kruskal's algorithm?
1. O(log V)
2. O(E log V)
3. O(E²)
4. O(V log E)
Answer : 2 - O(E log V)

* Be the First to Post a Comment.

Note : Name and Email never shown.