The Tree Measurer
A easy Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- easy
- Seniority
- L3
Interview Prompt
Given the root of a binary tree, return its maximum depth (the number of nodes on the longest root-to-leaf path). Each node is a nested dict with keys 'val', 'left', and 'right', where a missing child is None (null). An empty tree (root is None) has depth 0.
Summary
How deep does the rabbit hole go?
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision