-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmain.cxx
More file actions
64 lines (42 loc) · 1021 Bytes
/
main.cxx
File metadata and controls
64 lines (42 loc) · 1021 Bytes
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
62
#include <bits/stdc++.h>
#include <gtest/gtest.h>
using namespace std;
/**
* Definition for a binary tree node.
*/
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
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) return true;
return abs(height(root->left) - height(root->right)) <= 1 &&
isBalanced(root->left) && isBalanced(root->right);
}
};
struct T {
};
TEST(Solution, test) {
T ts[] = {
{
},
};
Solution solution;
for (T t : ts) {
}
}
int main() {
testing::InitGoogleTest();
return RUN_ALL_TESTS();
}