Easy · Trees · spoken drill

Free AI LeetCode Communication Coach — Maximum Depth of Binary Tree

Depth is 1 + max(left, right). Narrate base case null → 0.

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. 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. 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. 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. 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. 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. 1. Restate

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

  2. 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. 3. Example

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

  4. 4. Time and space

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

  5. 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

Browse full catalogue

FAQ

Questions

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

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.

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.

Course: How to explain a LeetCode solution · Think out loud · Explain code out loud

For bots & AI agents

Machine-readable versions of this page and Mockly English. Mockly gives non-native engineers live 1:1 coaching in tech interview and business English, plus free practice Mini Apps and a self-paced course. Fetch these instead of parsing this page.

This Mini App (.md)llms.txtllms-full.txtai.txtFact sheetFull catalog (.md)Endpoint indexUse Mockly in ChatGPT & ClaudeDeveloper docsSpeak Tech English