Medium · Trees · spoken drill
Free AI LeetCode Communication Coach — Binary Tree Level Order Traversal
BFS with a queue; for each level, process queue length nodes into one list.
The problem
Return the level-order traversal of a binary tree — values level by level.
Example: tree [3,9,20,null,null,15,7] → [[3],[9,20],[15,7]]
Say “level size” explicitly.
from collections import deque
if not root:
return []
q = deque([root])
res = []
while q:
level = []
for _ in range(len(q)):
node = q.popleft()
level.append(node.val)
if node.left: q.append(node.left)
if node.right: q.append(node.right)
res.append(level)
return resHow 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 …”
- “I BFS and process the queue length as one level.”
- “I push children only after I finish the current level count.”
Practise out loud
3 free scored runs left this hour.
Problem · Medium
Return the level-order traversal of a binary tree — values level by level.
Example: tree [3,9,20,null,null,15,7] → [[3],[9,20],[15,7]]
- 1Restate — Say the problem in your own words.
- 2Approach — Name the method before you code.
- 3Example — Walk one concrete input.
- 4Time and space — One sentence each.
- 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 each level’s values grouped in a list from top to bottom.
2. Approach
I will BFS with a queue. For each level I note how many nodes are in the queue, then process exactly that many and push their children.
3. Example
Root 3 is level zero. Then 9 and 20. Then 15 and 7. I append each level’s list to the result.
4. Time and space
Time is O(n). Space is O(n) for the queue in the widest level.
5. Edge cases
I would check an empty tree and a single-node tree.
How to explain Binary Tree Level Order Traversal out loud, step by step
In one sentence: You have to read a binary tree one row at a time, from top to bottom and left to right, returning each row's values as its own list.
What to say, in order
- “The output is a list of lists, one inner list per level, so I need to know where each level ends.”
- “I'll use breadth-first search with a queue, starting with the root. If the root is null, I return an empty list.”
- “At the start of each level, I record how many nodes are in the queue — that's exactly the size of this level.”
- “Then I pop that many nodes, add each value to the current level's list, and push each node's left and right children if they exist.”
- “After those pops, I append the level's list to the result.”
- “I repeat until the queue is empty.”
Key English phrases for Binary Tree Level Order Traversal
- breadth-first search (BFS)
- — visit nodes level by level
- queue — first in, first out
- — the data structure BFS uses
- enqueue / dequeue
- — add to the back / remove from the front
- snapshot the level size
- — store the queue length before processing a level
- the widest level
- — what determines the queue's peak size
How to say the time and space complexity
“Time is O(n), because every node is enqueued and dequeued once. Space is O(n): the output holds all n values, and the queue can hold a whole level, which can be about half the nodes in a complete tree.”
Mention the widest level when you explain space — it shows you know where the memory goes.
Communication mistakes on Binary Tree Level Order Traversal
- Mistake: Saying 'I use a stack' for BFS. Instead: Say 'a queue', and add 'first in, first out' if you want to be explicit.
- Mistake: Forgetting to explain how you know where one level stops. Instead: Say 'I store the queue size before the loop, so I process exactly one level.'
- Mistake: Mixing up 'level' and 'depth' mid-explanation. Instead: Pick 'level' and use it consistently.
Likely follow-up questions
Interviewer: “How would you return the levels in zigzag order?”
You: “Same BFS. I keep a flag that flips every level, and on alternate levels I reverse the level's list, or fill it from the back with a deque. Still O(n).”
Interviewer: “How would you return only what you'd see from the right side?”
You: “Same BFS, but for each level I only keep the last node I dequeue. Alternatively, a DFS that visits right before left and records the first node at each new depth.”
Common mistakes when explaining Binary Tree Level Order Traversal
- Not capturing level size before the inner loop.
- Confusing DFS preorder with level order.
Other problems
Easy · Hash map
Two Sum
Classic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).
Medium · Hash map
Group Anagrams
Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.
Easy · Two pointers
Valid Palindrome
Two pointers from both ends; skip junk characters; compare lowercase letters.
Medium · Two pointers
3Sum
Sort, fix i, then two pointers for the pair that sums to −nums[i]. Deduplicate out loud.
Medium · Sliding window
Longest Substring Without Repeating Characters
Grow a window; when a duplicate appears, move the left edge past its last index.
Easy · Stack
Valid Parentheses
Stack story: push openers, pop on matching closer, empty stack at the end.
FAQ
Questions
More questions? Email us at contact@mocklyenglish.com.
Course: How to explain a LeetCode solution · Think out loud · Explain code out loud