# Balanced Binary Tree: Interview Notes

Balanced Binary Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A height-DFS returns -1 as soon as a subtree has |left-right|>1; otherwise it returns height. The tree is balanced iff the root call is not -1.

## 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(n).

## Common mistake

Computing height separately for every node, which makes a balanced check O(n^2).

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