# Virtual Tree Key Vertices: Practice Notes
Virtual Tree Key Vertices shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Compress a set of k marked vertices to the tree of their pairwise LCAs, using a stack over the DFS-order to add only O(k) extra Steiner nodes.
## 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(k log n) or O(k) after an LCA structure, producing a tree of size O(k).
## Common mistake
Connecting two marked vertices by their tree path without inserting the LCA, which creates a virtual tree that is not a minor of the original.
## 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 AI interview helper that uses your resume.