/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
bool isSameTree(TreeNode* p, TreeNode* q) {
if(!p && !q) return true;
if (!p || !q) return false;
return p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
public:
bool isSubtree(TreeNode* s, TreeNode* t) {
if (s == t) {
return true;
}
if (!s && t) {
return false;
}
if (!t) {
return true;
}
return s->val == t->val && isSameTree(s, t) || isSubtree(s->left,t) || isSubtree(s->right,t);
}
};
if (s == t) { //两个节点是否一样
return true;
}
if (!s && t) { //母树都有null了t还还没有
return false;
}
if (!t) { //那么t为空就是子树了
return true;
}
//那么接下来满足 节点对应的值相等且满足一下条件都是子树
//两棵树是否一样||t是否在s的左子树||t是否在s的右子树里
return s->val == t->val && isSameTree(s, t) || isSubtree(s->left,t) || isSubtree(s->right,t);