题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
代码
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
bool ret = false;
if( pRoot1 == nullptr || pRoot2 == nullptr)
return false;
// 查找与子树根节点相同的母树节点
if(pRoot1->val == pRoot2->val)
ret = HasSubtreeCore(pRoot1,pRoot2); // 比较两棵树是否相同
if(!ret)
ret = HasSubtree(pRoot1->left, pRoot2);
if(!ret)
ret = HasSubtree(pRoot1->right, pRoot2);
return ret;
}
// 比较两棵树是否相同
bool HasSubtreeCore(TreeNode* pRoot1, TreeNode* pRoot2)
{
if (pRoot2 == nullptr)
return true;
if (pRoot1 == nullptr)
return false;
if (pRoot1->val != pRoot2->val)
return false;
return HasSubtreeCore(pRoot1->left , pRoot2->left) &&
HasSubtreeCore(pRoot1->right , pRoot2->right);
}
};