forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
110-Balanced-Binary-Tree.ts
32 lines (27 loc) · 901 Bytes
/
110-Balanced-Binary-Tree.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
* Definition for a binary tree node.
* class TreeNode {
* val: number
* left: TreeNode | null
* right: TreeNode | null
* constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
* }
*/
function isBalanced(root: TreeNode | null): boolean {
let array = getHeight(root);
return array[0];
}
function getHeight(root: TreeNode | null) {
if (!root) return [true, 0];
let [leftBalanced, leftHeight] = getHeight(root.left);
let [rightBalanced, rightHeight] = getHeight(root.right);
let balanced =
leftBalanced &&
rightBalanced &&
Math.abs(rightHeight - leftHeight) <= 1;
return [balanced, 1 + Math.max(leftHeight, rightHeight)];
}