[LeetCode] Symmetric Tree - Recursively

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSymmetric(TreeNode *p, TreeNode *q) {
        if (!p && !q) return true;
        if (!p || !q) return false;
        
        if (p->val != q->val) return false;
        
        return isSymmetric(p->left, q->right) && isSymmetric(p->right, q->left);
    }
    
    bool isSymmetric(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (!root) return true;
        
        return isSymmetric(root->left, root->right);
    }
};

Small Case: 12ms

Large Case: 24ms

Time: O(n)

Space: O(1)