leetcode【100 相同的树】

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */


bool isSameTree(struct TreeNode* p, struct TreeNode* q)
{
    
    
    if(!p && !q) 
        return true;
    if((p && !q) || (!p && q)) 
        return false;
    if(q->val != p->val) 
        return false;
        return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}