Welcome to the Python screen.
The question is on your right: Check Binary Tree Balance. Read through the requirements first.
Run and submit your code as often as you need. You also have five interviewer messages this session - want to talk through your approach, or are you ready to start coding?
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.
root, the root node of a binary tree, or null for an empty tree.True if the tree is height-balanced; otherwise False.def is_balanced(root):