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