# Auxiliary Tree Of Key Vertices: Walkthrough
Auxiliary Tree Of Key Vertices shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Extract the virtual tree on a subset by sorting vertices by DFS time and inserting LCAs, so a subset DP runs on O(|S|) 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(|S| log n) with binary lifting LCA plus a stack build.
## Common mistake
Connecting keys by real-tree parent pointers instead of LCAs, which can miss the true virtual edges.
## 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 try it free.