# Count Complete Tree Nodes: Practice Notes
Count Complete Tree Nodes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
If the leftmost and rightmost heights match the subtree is perfect and has 2^h-1 nodes; otherwise recurse both children. The complete shape makes this better than a full walk.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log^2 n).
## Common mistake
Counting every node with a linear DFS, which the follow-up asks you to beat.
## 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 https://www.linkjob.ai/.