树的子结构

/*struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    
    bool MakeSureHave(TreeNode* pRoot1,TreeNode* pRoot2){
        if(pRoot2 == NULL)
            return true;
        if(pRoot1 == NULL)
            return false;
        if(pRoot1->val == pRoot2->val){
            if(MakeSureHave(pRoot1->left,pRoot2->left)
               && MakeSureHave(pRoot1->right,pRoot2->right))
                return true;
        }
        if(MakeSureHave(pRoot1->left,pRoot2))
           	return true;
        if(MakeSureHave(pRoot1->right,pRoot2))
           	return true;
        return false;
    }
    
	bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
	{
        if(pRoot2 == NULL)
            return false;
        if(MakeSureHave(pRoot1,pRoot2))
            return true;
        return false;
	}
};