-
Notifications
You must be signed in to change notification settings - Fork 2
/
isBalanced.cpp
41 lines (35 loc) · 1.01 KB
/
isBalanced.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
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int height(map<TreeNode *, int> &tmap, TreeNode *root) {
if (root == NULL) {
return 0;
}
int l = height(tmap, root->left);
int r = height(tmap, root->right);
int h = ((l > r) ? l : r);
tmap[root] = abs(l-r);
return (h+1);
}
bool isBalanced(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
map<TreeNode *, int> tmap;
height(tmap, root);
map<TreeNode *, int>::iterator it;
for (it = tmap.begin(); it != tmap.end(); ++it) {
if (it->second >= 2)
return false;
}
// Start typing your code here...
return true;
}
};