【2022初春】【LeetCode】【树】572. 另一棵树的子树

一开始的思路对了80%，但是还是细节上有问题

/**
 * 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 isSubtree(TreeNode root, TreeNode subRoot) {
        if(root==null) return false;
        return judge(root,subRoot)||isSubtree(root.left,subRoot)||isSubtree(root.right,subRoot);
                   
    }
    boolean judge(TreeNode root, TreeNode subRoot){
        if(root==null&&subRoot==null) return true;
        if(root==null&&subRoot!=null) return false;
        if(root!=null&&subRoot==null) return false;
        if(root.val!=subRoot.val) return false;
        return judge(root.left,subRoot.left)&&judge(root.right,subRoot.right);
    }
}