题目描述:输入两棵二叉树A、B,判断B是否是A的子树
思路:
- 先找到A中与B根节点相同的节点
- 从该节点递归的判断是否其左右子树都相等
代码:
class Solution {
public:
bool fun(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot2 == NULL)
{
return true;
}
if(pRoot1 == NULL)
{
return false;
}
if(pRoot1->val != pRoot2->val)
{
return false;
}
return fun(pRoot1->left, pRoot2->left) && fun(pRoot1->right, pRoot2->right);
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
bool result = false;
if(pRoot1 != NULL && pRoot2 != NULL)
{
if(pRoot1->val == pRoot2->val)
{
result = fun(pRoot1, pRoot2);
}
if(!result)
{
result = fun(pRoot1->left, pRoot2);
}
if(!result)
{
result = fun(pRoot1->right, pRoot2);
}
}
return result;
}
};