题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
AC C++ Solution:
递归:
class Solution {
public:
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);
}
private:
bool dfs(TreeNode* r1, TreeNode* r2) {
if(r2 == NULL)
return true;
if(r1 == NULL)
return false;
if(r1->val != r2->val)
return false;
return dfs(r1->left,r2->left) && dfs(r1->right,r2->right);
}
};