输入两颗二叉树A，B，判断B是不是A的子结构。(树中可能有重复的值)

题目描述

bool BeOne(TreeNode* pRoot1,TreeNode* pRoot2){
if(pRoot2 ==NULL)
return true;
if(pRoot1 == NULL)
return false;

if(pRoot1->val == pRoot2->val){
return BeOne(pRoot1->left,pRoot2->left) && BeOne(pRoot1->right,pRoot2->right);
}else
return false;
}
public:
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot1 == NULL || pRoot2 == NULL)
return false;
bool found = BeOne(pRoot1,pRoot2);
if(!found)
found = HasSubtree(pRoot1->left,pRoot2);
if(!found)
found = HasSubtree(pRoot1->right,pRoot2);
return found;
}