17-数的子结构

1. 题目描述

2. 题解

------------------------------------------------【2021-08-08】更新-------------------------------------------------------

/**
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 sol(root1,root2)||HasSubtree(root1.left,root2)|| HasSubtree(root1.right,root2);   
    }

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