输入两棵二叉树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 IsSubtree(TreeNode* p1, TreeNode* p2){
if(p2==NULL)return 1;
if(p1==NULL)return 0;
if(p1->val != p2->val)return 0;
return IsSubtree(p1->left,p2->left) && IsSubtree(p1->right,p2->right);
}
bool HasSubtree(TreeNode* p1, TreeNode* p2)
{
if(p1==NULL || p2==NULL)return 0;
return IsSubtree(p1,p2)||
HasSubtree(p1->left,p2) ||
HasSubtree(p1->right,p2);
}
};