leetcode572 另一个树的子树（未写代码）

class Solution {
public:
    bool isSubtree(TreeNode* s, TreeNode* t) {
        
        if(!s) return false;
        if (isSame(s,t)) return true; //s树和t树一样的情况
        
        return isSubtree(s->left,t) || isSubtree(s->right,t);//s的左子树和t一样或者s的右子树的t一样
        
    }
    bool isSame(TreeNode *s, TreeNode *t)
    {
        if (!s && !t) return true;
        if (!s || !t) return false;
        if (s->val != t->val) return false;
        
        return isSame(s->left, t->left) && isSame(s->right, t->right);
        
    }
};

参考：
https://leetcode.com/problems/subtree-of-another-tree/discuss/102767/c%2B%2B-recursive