# Count The Number Of Possible Root Nodes: Study Guide

Count The Number Of Possible Root Nodes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

n nodes, guesses about some parent->child edges, and a threshold k. Count how many roots make at least k guesses correct. Root the tree at 0 and compute the correct-guess count; then reroot: moving the root across an edge changes the count by ±1 depending on whether that directed guess exists. DFS reroot in O(n).

## 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 + guesses).

## Common mistake

Rerooting from scratch for every candidate (O(n^2)) or treating guesses as undirected.

## 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 interview copilot app.