【无标题】l力扣100. 相同的树

 * 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;
…    }
}java
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        boolean loop= true;//设置默认真值
        if(p==null&&q==null){//判断是否到底
            return loop;
       }
       if((p!=null&&q==null)||(p==null&&q!=null)||p.val!=q.val){//判断是否相同
            return false;
       }//若当前loop为false 则loop不进行覆盖
       if(loop) 
       loop= isSameTree(p.left,q.left);
        if(loop)
        loop=isSameTree(p.right,q.right);
        return loop;}
}