思路:和对称树是一样的思路,直接递归即可。
/**
* 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 {
boolean flag=true;
public boolean isSameTree(TreeNode p, TreeNode q) {
return qianxu(p,q);
}
public boolean qianxu(TreeNode t1,TreeNode t2){
if((t1==null&&t2!=null)||(t1!=null&&t2==null)){
return false;
}
if(t1==null&&t2==null)
return true;
if(t1.val!=t2.val)
return false;
return t1.val==t2.val&&qianxu(t1.left,t2.left)&&qianxu(t1.right,t2.right);
}
}