输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路:
二叉树B的根节点依次与二叉树A的每个节点比较,如果节点值相同,再依次比较子节点是否一致
注意递归循环结束的条件,并且要防止越界
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool thecompare(TreeNode* pRoot1, TreeNode* pRoot2)
{
bool flag1,flag2;
if(pRoot2 == NULL) return true;
if(pRoot1 == NULL) return false;
if(pRoot1->val == pRoot2->val)
{
flag1 = thecompare(pRoot1->left,pRoot2->left);
flag2 = thecompare(pRoot1->right,pRoot2->right);
if(flag1 && flag2) return true;
}
return false;
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if (pRoot1 == NULL || pRoot2 == NULL) return false;
return thecompare(pRoot1,pRoot2)||HasSubtree(pRoot1->left,pRoot2)||HasSubtree(pRoot1->right,pRoot2);
}
};