class Solution {

    public:

        bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2) {//找到子树的根节点

            if(pRoot1 == NULL || pRoot2 == NULL) return false;

            bool ans = false;

            if(pRoot1->val == pRoot2->val) ans = isSubtree(pRoot1, pRoot2);

            if(!ans) ans = HasSubtree(pRoot1->left, pRoot2);

            if(!ans) ans = HasSubtree(pRoot1->right,pRoot2);

            return ans;

        }

        bool isSubtree(TreeNode* t1, TreeNode* t2) {//判断左右子树是否一致

            if(t2 == NULL) return true;

            if(t1 == NULL) return false;

            bool ans = true;

            if(t1->val != t2->val) return false;

            if(ans) ans = isSubtree(t1->left, t2->left);

            if(ans) ans = isSubtree(t1->right,t2->right);

            return ans;

        }

};