题目描述
输入两棵二叉树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 result = false;
if(pRoot1 && pRoot2)
{
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;
}
bool isSubtree(TreeNode *tree1, TreeNode *tree2)
{
if(!tree2) return true;
if(!tree1) return false;
if(tree1->val != tree2->val) return false;
return isSubtree(tree1->left, tree2->left) &&
isSubtree(tree1->right, tree2->right);
}
};