【剑指offer】树的子结构

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

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

public boolean HasSubtree(TreeNode root1, TreeNode root2) {
    boolean result = false;

    if (root1 != null && root2 != null){
        if (root1.val == root2.val)
            result = DoesTree1HasTree2(root1, root2);

        if (result == false)
            result = HasSubtree(root1.left, root2);

        if (result == false)
            result = HasSubtree(root1.right, root2);
    }

    return result;
}

private boolean DoesTree1HasTree2(TreeNode root1, TreeNode root2){
    if (root2 == null)
        return true;
    else if (root1 == null)
        return false;
    else if (root1.val != root2.val)
        return false;
    
    return DoesTree1HasTree2(root1.left, root2.left) && DoesTree1HasTree2(root1.right, root2.right);
}