-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathSame_Tree.cpp
40 lines (36 loc) · 937 Bytes
/
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
/*
Same Tree
Given two binary trees, write a function to check if they are
equal or not.
Two binary trees are considered equal if they are structurally identical
and the nodes have the same value.
*/
/**
* Definition for binary tree
* 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;
else if (p != NULL && q == NULL)
return false;
else if (p == NULL && q != NULL)
return false;
else {
bool result = isSameTree(p->left, q->left);
if (!result)
return false;
if (p->val != q->val) {
return false;
}
return isSameTree(p->right, q->right);
}
}
};