-
Notifications
You must be signed in to change notification settings - Fork 0
/
100.same-tree.cpp
42 lines (40 loc) · 1001 Bytes
/
100.same-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
/*
* @lc app=leetcode id=100 lang=cpp
*
* [100] Same Tree
*/
// @lc code=start
/**
* 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 isSameTree(TreeNode* p, TreeNode* q) {
if (p==NULL&&q==NULL) {
return true;
}
if ((p==NULL&&q!=NULL) || (p!=NULL&&q==NULL)) {
return false;
}
if (p->val!=q->val) {
return false;
} else {
if (isSameTree(p->left,q->left)==false) {
return false;
}
if (isSameTree(p->right,q->right)==false) {
return false;
}
}
return true;
}
};
// @lc code=end