Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric:

    1
   / \
  2   2
 / \ / \
3  4 4  3

But the following is not:

    1
   / \
  2   2
   \   \
   3    3

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