A binary tree is height-balanced when, for every node, the depths of its two subtrees differ by at most 1. Return true if the tree is balanced. Input format Level-order JSON array with nulls, e.g. [[3,9,20,null,null,15,7]] . TreeNode is predefined.