The Balanced Inspector

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

Domain

Python

Difficulty

medium

Seniority

L4

Problem

You're validating binary trees coming out of a parser, each given as a nested dict with keys `val`, `left`, and `right`, where a missing child is `None` and the whole tree may itself be `None`. Return `True` when the tree is height-balanced: at every node the heights of the left and right subtrees differ by at most 1. An empty tree counts as balanced.

Summary

Every branch should carry the same weight.

Practice This Problem

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