Tag: LeetCode: 110 Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: A binary tree in which the left and right subtrees of every node differ in height by no more than 1. Example: Input: root = [3,9,20,null,null,15,7] Output: true Input: root =…