参考网址:https://blog.csdn.net/yangquanhui1991/article/details/51786155
解题思路:
(1)首先判断两棵树的根结点是否相同,相同的话,继续比较他们的左右子树
(2)如果根结点不相同,将A的左右子树的根结点当做初始结点,再和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) return false;
else return comp(pRoot1,pRoot2)||HasSubtree(pRoot1->left,pRoot2)||HasSubtree(pRoot1->right,pRoot2);
}
bool comp(TreeNode* p1, TreeNode* p2) {
if (p2==NULL) return true;
else if (p1==NULL) return false;
if (p1->val!=p2->val) return false;
else return comp(p1->left,p2->left)&&comp(p1->right,p2->right);
}
};