题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
class Solution {
public:
bool isSubtree(TreeNode* pRootA, TreeNode* pRootB)
{
if(pRootB==NULL)return true;
if(pRootA==NULL)return false;
if(pRootA->val!=pRootB->val)return false;
return isSubtree(pRootA->left,pRootB->left)&&isSubtree(pRootA->right,pRootB->right);
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
bool result=false;
// if(pRoot1==NULL||pRoot2==NULL)return false;
if(pRoot1!=NULL&&pRoot2!=NULL)
{
if(pRoot1->val==pRoot2->val) result = isSubtree(pRoot1,pRoot2);
if(!result) result=HasSubtree(pRoot1->left,pRoot2);
if(!result) result=HasSubtree(pRoot1->right,pRoot2);
}
return result;
}
};