forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjaejeong1.java
More file actions
36 lines (30 loc) · 805 Bytes
/
jaejeong1.java
File metadata and controls
36 lines (30 loc) · 805 Bytes
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
// Definition for a binary tree node.
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
// 풀이: 재귀로 left와 right를 비교하면서 같은지 확인한다.
// TC: O(N)
// SC: O(N)
return dfs(p, q);
}
private boolean dfs(TreeNode p, TreeNode q) {
if (p == null || q == null) {
return p == q; // 둘 다 null이면 true, 하나만 null이면 false
}
if (p.val != q.val) { // 값이 다르면 false
return false;
}
return dfs(p.left, q.left) && dfs(p.right, q.right);
}
}