How should I practice Balanced Binary Tree?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google phone screen problems in FastPrep.

Is Balanced Binary Tree associated with Google?

FastPrep tags this as a Google phone screen coding practice problem when the problem catalog has that company and stage context.

Google● EasyNEW GRADPHONE SCREEN

Given the root of a binary tree, determine whether it is height-balanced.

A binary tree is height-balanced when, at every node, the heights of the left and right subtrees differ by at most one.

isBalanced(root: TreeNode) → boolean

root = [3,9,20,null,null,15,7]return = true

Every node's two subtree heights differ by at most one.

root = [1,2,2,3,3,null,null,4,4]return = false

The left side contains a node whose subtree heights differ by more than one.

root = []return = true

An empty tree is height-balanced.