How do you build a minimum spanning tree with Kruskal or Prim?
PICTURE THIS: HOW TO EXPLAIN IT
Simple meaning
Kruskal sorts edges by weight and adds an edge if Union-Find says the ends are in different components: O(E log E).
WHY — Graphs instead of guessing?
Why interviewers care about Graphs:
question about Graphs.
trade-offs, and what you would actually do on a DSA project - not buzzwords.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Kruskal sorts edges by
weight and adds an edge if Union-Find says the ends are in different components: O(E log E).
- 2Prim grows from a
vertex with a min-heap of candidate edges: O(E log V).
- 3Both yield a tree
of V-1 edges with minimum total weight on an undirected connected graph.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Kruskal sorts edges by weight and adds an edge if Union-Find says the ends are in different components: O(E log E). Prim grows from a vertex with a min-heap of candidate edges: O(E log V).