Balanced Binary Tree
Difficulty: EasyTopic: TreeDepth-First SearchBinary TreeLeetcode:110.Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.
Example 1:
Input: root = [3,9,20,null,null,15,7]
Output: true
Example 2:
Input: root = [1,2,2,3,3,null,null,4,4]
Output: false
Example 3:
Input: root = []
Output: true
Constraints:
- The number of nodes in the tree is in the range
[0, 5000]. -104 <= Node.val <= 104
Solution
write solution in here
/**
* @param {TreeNode} root
* @return {boolean}
*/
var isBalanced = function(root) {
let res = true
var traverse = function(root) {
if (!root) return 0
let l = traverse(root.left),
r = traverse(root.right)
if (Math.abs(l - r) > 1) {
res = false
}
return Math.max(l, r) + 1
}
traverse(root)
return res
};