public class  {
    class TreeNode {
        int val = 0;
        TreeNode left = null;
        TreeNode right = null;
        public TreeNode(int val) {
            this.val = val;
        }
    }
    public boolean has(TreeNode root1, TreeNode root2) {
        boolean result = false;
        if(root1 != null && root2 != null){
            if(root1.val == root2.val){
                result = doHasSubTree(root1, root2);
            }
            if(!result){
                result = has(root1.left, root2);
            }
            if(!result){
                result = has(root1.right, root2);
            }
        }
        return result;
    }
    private boolean doHasSubTree(TreeNode root1, TreeNode root2){
        if(root2 == null){
            return true;
        }
        if(root1 == null){
            return false;
        }
        if(root1.val != root2.val){
            return false;
        }
        return doHasSubTree(root1.left, root2.left) && doHasSubTree(root1.right, root2.right);
    }
}