Check Height-Balanced Binary Tree | Dataford Interview Questions

Given the root of a binary tree, return True if the tree is height-balanced and False otherwise. A binary tree is height-balanced if, for every node, the heights of its left and right subtrees differ by at most 1.

Constraints

The number of nodes in the tree is in the range [0, 5000]
-10^4 <= Node.val <= 10^4
Input is a valid binary tree

Function Signature

def is_balanced(root=None, val=None, left=None, right=None):

Your question is Check Height-Balanced Binary Tree. 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

Constraints

The number of nodes in the tree is in the range [0, 5000]
-10^4 <= Node.val <= 10^4
Input is a valid binary tree

Function Signature

def is_balanced(root=None, val=None, left=None, right=None):

Your question is Check Height-Balanced Binary Tree. 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.