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 (nested dict with 'val', 'left', 'right'; None for no child), return its maximum depth (number of nodes on the longest root-to-leaf path).
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