Check Binary Tree Balance | Dataford Interview Questions

In a Meta-style coding interview, you may be asked to validate whether a binary tree is structurally balanced enough for efficient traversal. Given the root of a binary tree, determine whether it is height-balanced.

A binary tree is height-balanced if, for every node, the absolute difference between the heights of its left and right subtrees is at most 1.

Formal Specification

Input: root, the root node of a binary tree, or null for an empty tree.
Output: True if the tree is height-balanced; otherwise False.

Constraints

The number of nodes in the tree is in the range [0, 5000]
-10^4 <= Node.val <= 10^4
A tree is height-balanced if every node has left and right subtree heights differing by at most 1

Function Signature

def is_balanced(root):

Your question is Check Binary Tree Balance. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem