A easy Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

easy

Seniority

L3

Problem

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?

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.