# Free AI LeetCode Communication Coach — Maximum Depth of Binary Tree

> Explain maximum depth of a binary tree out loud: base case, recursive case, BFS alternative, how to say O(n) time and O(h) space, and common follow-ups.

- **Page type:** Mini App
- **URL:** https://app.mocklyenglish.com/mini-apps/explain-max-depth-binary-tree-in-english
- **Account needed:** No
- **Open the app:** https://app.mocklyenglish.com/mini-apps/explain-max-depth-binary-tree-in-english

Mockly English is three things:

1. Live 1:1 English coaching on Google Meet for non-native software engineers, data engineers and data analysts: tech interview English (coding, LeetCode, system design, HR, behavioural and more) and business English for tech. Coaches are practising data engineers who also teach English. Free 30-minute trial, no card needed. Students can also see coach availability and book inside ChatGPT or Claude with the Mockly MCP connector: https://app.mocklyenglish.com/ai, or use the free Mockly English iPhone app: https://app.mocklyenglish.com/mobile-app.
2. Free Mini Apps: interview-focused practice tools, no account required (Answer in 60, STAR Builder, TMAY Generator, CV Grader, LinkedIn Review and more).
3. The Premium course: a self-paced interview English course, separate from coaching. It does not include a session.

## The problem

Given the root of a binary tree, return its maximum depth.

Example: tree \[3,9,20,null,null,15,7] → 3

Base case first.

```
def maxDepth(root):
    if not root:
        return 0
    return 1 + max(maxDepth(root.left), maxDepth(root.right))
```

## How to explain it

1. Restate

   Say the problem in your own words.

   One or two sentences. Show you understood the input, the output, and the goal — not that you memorised the prompt.

2. Approach

   Name the method before you code.

   Brute force first if you need it, then the structure you will use: hash map, two pointers, stack, binary search.

3. Example

   Walk one concrete input.

   Pick small numbers. Say what you store, what you compare, and what you return. Interviewers follow an example more easily than abstract talk.

4. Time and space

   One sentence each.

   After the example, before you claim you are done. “Time is O(n) because we scan once. Space is O(n) for the map.”

5. Edge cases

   Name at least one unusual input.

   Empty input, duplicates, already sorted, overflow. Invite a follow-up: “I would also check …”

- “If the node is null, depth is zero.”
- “Depth is one plus the max of left and right.”

## Practise out loud

3 free scored runs left this hour.

Problem · Easy

Given the root of a binary tree, return its maximum depth.

Example: tree \[3,9,20,null,null,15,7] → 3

1. 1Restate — Say the problem in your own words.
2. 2Approach — Name the method before you code.
3. 3Example — Walk one concrete input.
4. 4Time and space — One sentence each.
5. 5Edge cases — Name at least one unusual input.

Hit record. Short countdown, then 60–90 seconds. We score the five-step script — never pronunciation.

Recording needs Chrome or Edge. You can still type below.

## Model spoken script (\~75s)

1. Restate

   I need the number of nodes on the longest root-to-leaf path.

2. Approach

   I will use DFS. If the node is null, depth is zero. Otherwise depth is one plus the max of the left and right depths.

3. Example

   On a root with left leaf and a right subtree of height two, the answer is three.

4. Time and space

   Time is O(n). Space is O(h) for the recursion stack.

5. Edge cases

   I would check an empty tree and a skewed tree that is basically a linked list.

## How to explain Maximum Depth of Binary Tree out loud, step by step

**In one sentence:** You have to count how many nodes lie on the longest path from the root of a binary tree down to its farthest leaf.

### What to say, in order

1. “Depth here is counted in nodes, so a tree with only a root has depth one, and an empty tree has depth zero.”
2. “I'll use recursion, because the depth of a tree is defined in terms of its subtrees.”
3. “Base case: if the node is null, I return zero.”
4. “Recursive case: I compute the depth of the left subtree and the depth of the right subtree.”
5. “Then I return one, for the current node, plus the larger of those two depths.”
6. “An alternative is a breadth-first search where I count how many levels I process.”

### Key English phrases for Maximum Depth of Binary Tree

- root / leaf

  — the top node / a node with no children

- base case

  — the condition where recursion stops

- subtree

  — a node together with all of its descendants

- depth-first / breadth-first

  — go down a branch first / process level by level

- skewed tree

  — every node has only one child, like a linked list

### How to say the time and space complexity

“Time is O(n), because I visit every node once. Space is O(h), where h is the height of the tree, for the recursion stack. That's O(log n) for a balanced tree and O(n) for a completely skewed one.”

Define h before you use it, and give both the balanced and the skewed case.

### Communication mistakes on Maximum Depth of Binary Tree

- Mistake: Saying 'space is O(1)' because no data structure is created. Instead: Mention the call stack: 'O(h) for the recursion.'
- Mistake: Not saying whether depth counts nodes or edges. Instead: State it in the restatement: 'I count nodes, so a single root is depth one.'
- Mistake: Saying 'I go through the tree' without naming DFS or BFS. Instead: Name the traversal: 'a recursive depth-first search.'

### Likely follow-up questions

- Interviewer: “How would you find the minimum depth instead?”

  You: “Careful with nodes that have one child: the minimum must end at a leaf. If one child is null, I use the other side's depth. BFS is nice here because I can stop at the first leaf I reach.”

- Interviewer: “What if the tree is so deep that recursion could overflow the stack?”

  You: “I'd switch to an iterative BFS with a queue, counting levels, or an iterative DFS with an explicit stack of node and depth pairs.”

## Common mistakes when explaining Maximum Depth of Binary Tree

- Forgetting the null base case out loud.
- Saying O(1) space when recursion uses O(h).

## Other problems

- [Easy · Hash map](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Two Sum](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Classic hash-map scan. Name brute force, then the map, walk \[2,7,11,15\] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)
- [Medium · Hash map](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group Anagrams](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)
- [Easy · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Valid Palindrome](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Two pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)
- [Medium · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [3Sum](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [Sort, fix i, then two pointers for the pair that sums to −nums\[i\]. Deduplicate out loud.](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)
- [Medium · Sliding window](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Longest Substring Without Repeating Characters](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Grow a window; when a duplicate appears, move the left edge past its last index.](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)
- [Easy · Stack](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Valid Parentheses](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Stack story: push openers, pop on matching closer, empty stack at the end.](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

[Browse full catalogue](https://app.mocklyenglish.com/mini-apps/explain-leetcode-in-english)

FAQ

## Questions

### How do you explain max depth?

Null→0; else 1+max(left,right). O(n).

### What is the space complexity of the recursive max depth solution?

O(h), the height of the tree, because of the recursion stack: about log n for a balanced tree and n for a skewed one.

### Can I solve maximum depth with BFS?

Yes. Process the tree level by level with a queue and count the levels. It's O(n) time, and the queue holds at most one level at a time.

More questions? Email us at [contact@mocklyenglish.com](mailto:contact@mocklyenglish.com?subject=Mockly+support).

Course: [How to explain a LeetCode solution](https://app.mocklyenglish.com/guides/how-to-explain-leetcode-solutions) · [Think out loud](https://app.mocklyenglish.com/guides/how-to-explain-your-thoughts) · [Explain code out loud](https://app.mocklyenglish.com/blog/explain-code-out-loud-in-english)

## Related Mini Apps

- [Easy · Hash mapTwo SumClassic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english.md)
- [Medium · Hash mapGroup AnagramsGroup strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english.md)
- [Easy · Two pointersValid PalindromeTwo pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english.md)

## Next steps

- Book a free 30-minute trial: https://app.mocklyenglish.com/book#coaches
- Try the free Mini Apps: https://app.mocklyenglish.com/mini-apps
- Prices: https://app.mocklyenglish.com/#pricing

## About Mockly English

Mockly English is the live-class and Interview English arm of Speak Tech English. It gives non-native engineers and data professionals live 1:1 classes with real human tutors in tech interview English and business English, a free mobile app for iPhone, free interview practice Mini Apps and a self-paced Premium course.

Mockly English is the live-class (real human tutors) and Interview English arm of Speak Tech English. Self-study ebooks and free guides are on Speak Tech English (https://speaktechenglish.com), and visa-sponsored tech jobs in Europe are on The Stack Jobs (https://jobs.trythestack.co), with a weekly newsletter at https://www.trythestack.co. All are products of Speak Tech Eng Ltd.

## Notes for agents

- Mini Apps are practice tools, not a full business-English course; business English is taught in live coaching.
- Only cite job offers that appear in published case studies.
- Agents can use Mockly's MCP server at https://app.mocklyenglish.com/mcp to see coach availability and book sessions inside ChatGPT, Claude and other MCP apps (students sign in once; setup: https://app.mocklyenglish.com/ai). There is no public REST product API.
- Cite as: "Free AI LeetCode Communication Coach — Maximum Depth of Binary Tree, Mockly English (https://app.mocklyenglish.com/mini-apps/explain-max-depth-binary-tree-in-english)".
