The Tree Measurer
An easy Python mock interview question on DataDriven, with an AI interviewer who asks follow-up questions and a hire or no-hire decision at the end.
- Domain
- Python
- Difficulty
- easy
- Seniority
- L3
Interview Prompt
A binary tree arrives as its `root`, each node a nested dict with `val`, `left` and `right`, where a missing child is `None`. Return the tree's maximum depth along its 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 and run your Python against test cases
- Answer the interviewer's follow-up questions, then get a hire or no-hire decision