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

Given a binary tree represented as a dict with keys 'val', 'left', 'right' (subtrees or None), return True if for every node the heights of its left and right subtrees differ by at most 1 AND both subtrees are 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.