-
Notifications
You must be signed in to change notification settings - Fork 0
/
100. Same Tree.cpp
32 lines (30 loc) · 885 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
// https://leetcode.com/problems/same-tree/
/**
* 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)
{
return isSameTreeRecursive(p, q);
}
bool isSameTreeRecursive(TreeNode *p, TreeNode *q)
{
if (p == nullptr && q == nullptr)
return true;
if (p == nullptr || q == nullptr)
return false;
if (p->val != q->val)
return false;
return isSameTreeRecursive(p->left, q->left) && isSameTreeRecursive(p->right, q->right);
}
};