-
Notifications
You must be signed in to change notification settings - Fork 0
/
10 Same Tree
33 lines (31 loc) · 850 Bytes
/
10 Same Tree
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
//my solution
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p==NULL && q==NULL)
return true;
if(!p&&q || p&&!q)
return false;
if((!p->left && !p->right) && (!q->left && !q->right)) //leaf node
return p->val == q->val;
else
return (p->val==q->val)&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
}
};
//faster solution
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(!p||!q) return p==q;
return (p->val==q->val)&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
}
};