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