# Best Theorem Directed Trees: Study Guide
Best Theorem Directed Trees shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The number of distinct Eulerian circuits in a directed Eulerian graph equals any arborescence count times the product of (outdeg-1)! over vertices.
## 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
An arborescence count via the directed matrix-tree theorem, then the factorials.
## Common mistake
Using undirected spanning-tree counts on a directed graph, which overcounts or undercounts one-way arborescences.
## 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 official website.