Leetcode#572. 另一个树的子树,C++实现
1. 题目
2. 方法一
2.1. 代码
class Solution {
public:
bool isSubtree(TreeNode* s, TreeNode* t) {
if(t==NULL) return true;
if(s==NULL) return false;
return isSubtreewithroot(s,t)||isSubtree(s->left,t)||isSubtree(s->right,t);
}
bool isSubtreewithroot(TreeNode* s, TreeNode* t)
{
if(s==NULL&&t==NULL) return true;
if(s==NULL||t==NULL) return false;
if(t->val!=s->val) return false;
else return isSubtreewithroot(s->left,t->left)&&isSubtreewithroot(s->right,t->right);
}
};