输入两棵二叉树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)
{
if(NULL == pRoot1 || NULL == pRoot2)
return false;
return is_subtree(pRoot1,pRoot2) || HasSubtree(pRoot1->left,pRoot2) || HasSubtree(pRoot1->right,pRoot2);
}
bool is_subtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(NULL == pRoot2)
return true;
if(NULL == pRoot1)
return false;
return pRoot1->val == pRoot2->val && is_subtree(pRoot1->left,pRoot2->left) && is_subtree(pRoot1->right,pRoot2->right);
}
};