26、树的子结构

/**
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;
        if((root1.val==root2.val)&&(theSameTree(root1,root2))) return true;
        return (HasSubtree(root1.left,root2)) || (HasSubtree(root1.right,root2));
    }
    //判断以root2为根的树是不是以root1为根的树的树顶一部分
    public boolean theSameTree(TreeNode root1,TreeNode root2)
    {
        if(root2==null) return true;
        if(root1==null) return false;
        //这里没有考虑小数的误差
        if(root1.val==root2.val) return (theSameTree(root1.left,root2.left))&&(theSameTree(root1.right,root2.right));
        return false;
    }
}