-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path100.same-tree.cpp
More file actions
56 lines (54 loc) · 1.33 KB
/
100.same-tree.cpp
File metadata and controls
56 lines (54 loc) · 1.33 KB
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
// Tag: Tree, Depth-First Search, Breadth-First Search, Binary Tree
// Time: O(N)
// Space: O(H)
// Ref: -
// Note: -
// Given the roots of two binary trees p and q, write a function to check if they are the same or not.
// Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
//
// Example 1:
//
//
// Input: p = [1,2,3], q = [1,2,3]
// Output: true
//
// Example 2:
//
//
// Input: p = [1,2], q = [1,null,2]
// Output: false
//
// Example 3:
//
//
// Input: p = [1,2,1], q = [1,1,2]
// Output: false
//
//
// Constraints:
//
// The number of nodes in both trees is in the range [0, 100].
// -104 <= Node.val <= 104
//
//
/**
* 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 || !q) {
return p == q;
} else {
return (p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right));
}
}
};