forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathys-han00.cpp
More file actions
31 lines (29 loc) · 776 Bytes
/
ys-han00.cpp
File metadata and controls
31 lines (29 loc) · 776 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
/**
* 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 {
public:
bool ans = true;
void rec(TreeNode* p, TreeNode* q) {
if(p == nullptr && q == nullptr)
return;
else if(p && q && p->val == q->val) {
rec(p->left, q->left);
rec(p->right, q->right);
}
else
ans = false;
}
bool isSameTree(TreeNode* p, TreeNode* q) {
rec(p, q);
return ans;
}
};