输入两棵二叉树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 is_same(TreeNode* pRoot1, TreeNode* pRoot2)
{
if (pRoot2==NULL)
{
return true;
}
if (pRoot1==NULL&&pRoot2!=NULL)
{
return false;
}
if (pRoot1->val!=pRoot2->val)
{
return false;
}
return is_same(pRoot1->left, pRoot2->left) && is_same(pRoot1->right, pRoot2->right);
}
bool is_sonTree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if (pRoot1 == NULL&&pRoot2 != NULL)
{
return false;
}
if (pRoot2->val!=pRoot1->val)
{
return is_sonTree(pRoot1->left, pRoot2) || is_sonTree(pRoot1->right, pRoot2);
}
return is_same(pRoot1, pRoot2)||is_sonTree(pRoot1->left, pRoot2) || is_sonTree(pRoot1->right, pRoot2);
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
bool b;
if (pRoot1==NULL||pRoot2==NULL)
{
return false;
}
b = is_sonTree(pRoot1, pRoot2);
return b;
}
};
方法二
/*
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)
{
if(pRoot1==NULL||pRoot2==NULL){//有任意一个空树都会返回false
return false;
}
return isSubtree(pRoot1,pRoot2)||HasSubtree(pRoot1->left,pRoot2)||HasSubtree(pRoot1->right,pRoot2);
}
bool isSubtree(TreeNode* pRoot1,TreeNode* pRoot2){
if(pRoot2==NULL){//?????????????
return true;
}
if(pRoot1==NULL){
return false;
}
if(pRoot1->val==pRoot2->val){
return isSubtree(pRoot1->left,pRoot2->left)&&isSubtree(pRoot1->right,pRoot2->right);
}else{
return false;
}
}
};