# Prim Minimum Spanning Tree With A Heap: Practice Notes
Prim Minimum Spanning Tree With A Heap shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Grow from one vertex, always taking the cheapest edge that leaves the current tree.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(E log V).
## Common mistake
Allowing stale heap entries to add an already-included vertex twice.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at multilingual AI interview assistant.