In Kruskal's algorithm for finding Minimum Spanning Tree, which data structure…
2026
In Kruskal's algorithm for finding Minimum Spanning Tree, which data structure is primarily used ?
Answer: C. Disjoint Set Union — Kruskal's algorithm primarily uses Disjoint Set Union (DSU) to efficiently detect cycles when adding edges.
- A.
Queue
- B.
Stack
- C.
Disjoint Set Union
- D.
Priority Queue only
Attempted by 353 students.
Show answer & explanation
Correct answer: C
Kruskal's algorithm primarily uses Disjoint Set Union (DSU) to efficiently detect cycles when adding edges.
Loading lesson…