-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleetcode_100_Same_Tree.java
40 lines (35 loc) · 1.03 KB
/
leetcode_100_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
class leetcode_100_Same_Tree
{
public static 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;
}
}
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p == null && q == null)
{
return true;
}
if((p == null || q == null) || p.val != q.val)
{
return false;
}
boolean b1 = isSameTree(p.left, q.left),
b2 = isSameTree(p.right, q.right);
return (b1 && b2);
}
public static void main(String[] args)
{
TreeNode p = new TreeNode(1, new TreeNode(2), new TreeNode(3)),
q = new TreeNode(1, new TreeNode(2), new TreeNode(3));
boolean result = new leetcode_100_Same_Tree().isSameTree(p, q);
System.out.println(result);
}
}