# ET Tree Non Local Queries: Walkthrough
ET Tree Non Local Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Maintain an Euler tour in a treap; link and cut splice tours, and non-tree edges can be stored at tour nodes to support connectivity with extra edges.
## 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
Expected O(log n) per update.
## Common mistake
Storing a non-tree edge at only one endpoint so a cut loses track of replacement 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 Linkjob AI.