题解 | #树的子结构#

/** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null;

public TreeNode(int val) {
    this.val = val;

}

} */ public class Solution { public boolean HasSubtree(TreeNode root1,TreeNode root2) { if(root1 == null || root2 == null){ return false; } return isEqualFromRoot(root1,root2) || HasSubtree(root1.left,root2) || HasSubtree(root1.right,root2); } public boolean isEqualFromRoot(TreeNode root1,TreeNode root2){ if(root2 == null){ return true; } if(root1 == null || root1.val != root2.val){ return false; } return isEqualFromRoot(root1.left,root2.left) && isEqualFromRoot(root1.right,root2.right); } }