-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path110. Balanced Binary Tree.cpp
61 lines (46 loc) · 1.18 KB
/
110. Balanced Binary Tree.cpp
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
int height(TreeNode *root) {
if (!root)
return 0;
return 1 + max(height(root->left), height(root->right));
}
public:
bool isBalanced(TreeNode* root) {
if(!root)
return true;
return isBalanced(root->right) && isBalanced(root->left) && (abs(height(root->left) - height(root->right)) <=1);
}
};
-------------------
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
int height(TreeNode *root) {
if(!root)
return 0;
return 1 + max(height(root->left),height(root->right));
}
public:
bool isBalanced(TreeNode* root) {
if (root == NULL)
return true;
return (abs(height(root->left) - height(root->right)) < 2) && isBalanced(root->left) && isBalanced(root->right);
}
};