-
Notifications
You must be signed in to change notification settings - Fork 90
/
Copy pathmain.cpp
38 lines (34 loc) · 856 Bytes
/
main.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
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
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 isSameTree(TreeNode *p, TreeNode *q)
{
if (p == NULL && q == NULL)
return true;
if (p == NULL || q == NULL)
return false;
if (p->val != q->val)
return false;
return isSameTree(p->right, q->right) && isSameTree(p->left, q->left);
}
};
int main()
{
Solution s;
TreeNode *p = new TreeNode(1);
TreeNode *q = new TreeNode(1);
cout << s.isSameTree(p, q) << endl;
return 0;
}