How do you find the height of a binary tree?
PICTURE THIS: HOW TO EXPLAIN IT
Simple meaning
Height is 1 plus the max of left and right subtree heights, with empty as -1 or 0 depending on the convention you state.
WHY — Trees instead of guessing?
Why interviewers care about Trees:
question about Trees.
trade-offs, and what you would actually do on a DSA project - not buzzwords.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Height is 1 plus
the max of left and right subtree heights, with empty as -1 or 0 depending on the convention you state.
- 2Recursion visits each node
once: O(n) time and O(h) space.
- 3A level-order BFS that
counts layers is also O(n) and avoids deep recursion.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Height is 1 plus the max of left and right subtree heights, with empty as -1 or 0 depending on the convention you state. Recursion visits each node once: O(n) time and O(h) space.