# Link-Cut Tree Make-Root Operation: Explained
Link-Cut Tree Make-Root Operation shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Expose v, reverse the path from v to the old root with a lazy flip, and v becomes the new root of its represented 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
Amortized O(log n).
## Common mistake
Skipping the path reverse, so parent/child direction along the exposed path stays wrong.
## 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 job search and interview copilot.