forked from neetcode-gh/leetcode
- Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0100-same-tree.java
40 lines (33 loc) · 853 Bytes
/
0100-same-tree.java
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
packagejava;
/**
* Definition for a binary tree node.
* public 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;
* }
* }
*/
classSolution {
publicbooleanisSameTree(TreeNodep, TreeNodeq) {
returndfs(p, q);
}
privatebooleandfs(TreeNodep, TreeNodeq) {
if (p == null && q == null) {
returntrue;
}
if (p == null || q == null) {
returnfalse;
}
if (p.val != q.val) returnfalse;
booleanleft = dfs(p.left, q.left);
booleanright = dfs(p.right, q.right);
returnleft && right;
}
}