Check Height-Balanced Binary Tree

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Check Height-Balanced Binary Tree. Start with the requirements on the right.

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

You need to log in / sign up to run or submit.

Problem

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 solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output