-
Notifications
You must be signed in to change notification settings - Fork 1
/
SameTree.java
38 lines (29 loc) · 841 Bytes
/
SameTree.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
package com.leetcode;
public class SameTree {
//https://leetcode.com/problems/same-tree/
class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(q == null && p == null) return true;
if((q == null && p != null) || (p == null && q != null)) return false;
if(q.val != p.val) return false;
return isSameTree(p.left,q.left) && isSameTree(p.right,q.right);
}
}
/**
* 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.left = left;
this.right = right;
}
}
}