LeetCode 572.另一棵树的子树

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q){
        if(p == nullptr || q == nullptr){
            return p == q;
        }else{
            if(p->val == q->val){
                return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
            }
            else return false;
        }
        
    }
    bool isSubtree(TreeNode* root, TreeNode* subRoot) {
        if(root == nullptr)
            return false;
        else{
            return isSameTree(root, subRoot) || isSubtree(root->left, subRoot) || isSubtree(root->right, subRoot);
        }         
    }
};