# Euler Tour Subtree Queries: Walkthrough

Euler Tour Subtree Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Record enter and exit times in a DFS and replace a subtree query with a range query on the [in[u], out[u]] interval of an array or Fenwick 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(n) to build the tour; query cost matches the range structure (O(log n) with a Fenwick tree).

## Common mistake

Using [in[u], in[u] + size[u] - 1] when the tour stored both enter and exit events, which covers the wrong set of indices.

## 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 real-time AI interview assistant for live interviews.