LeetCode 572. 另一个树的子树
原题链接
简单
作者:
大明湖的鱼
,
2021-01-25 22:45:16
,
所有人可见
,
阅读 333
/**
* 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 {
public:
bool isSametree(TreeNode* s, TreeNode* t){
if(s == nullptr && t == nullptr) return true;
return s && t
&& s->val == t->val
&& isSametree(s->left,t->left)
&& isSametree(s->right,t->right);
}
bool isSubtree(TreeNode* s, TreeNode* t) {
if(s == nullptr && t == nullptr) return true;
if(s == nullptr && t != nullptr) return false;
return isSametree(s,t) || isSubtree(s->left,t) || isSubtree(s->right,t);
}
};