36 lines
756 B
Java
36 lines
756 B
Java
/*
|
|
* @lc app=leetcode id=100 lang=java
|
|
*
|
|
* [100] Same Tree
|
|
*/
|
|
|
|
// @lc code=start
|
|
/**
|
|
* 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;
|
|
* }
|
|
* }
|
|
*/
|
|
class Solution {
|
|
public boolean isSameTree(TreeNode p, TreeNode q) {
|
|
if(p == null || q == null) {
|
|
return p == q;
|
|
}
|
|
if(p.val != q.val) {
|
|
return false;
|
|
}
|
|
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
|
|
}
|
|
}
|
|
// @lc code=end
|
|
|