C++ easy solution with comments 0ms 100% faster
\nclass Solution {\npublic:\n    bool isSymmetric(TreeNode* root) {\n        \n        if(root==NULL) return true; //Tree is empty\n        \n        return isS
```\nclass Solution {\npublic:\n    bool isSymmetric(TreeNode* root) {\n        \n        if(root==NULL) return true; //Tree is empty\n        \n        return isSymmetricTest(root->left,root->right);\n    }\n    \n    bool isSymmetricTest(TreeNode* p , TreeNode* q){\n        if(p == NULL && q == NULL) //left & right node is NULL \n            return true; \n        \n        else if(p == NULL || q == NULL) //one of them is Not NULL\n            return false; \n        \n        else if(p->val!=q->val) \n            return false;\n        \n        return isSymmetricTest(p->left,q->right) && isSymmetricTest(p->right,q->left); //comparing left subtree\'s left child with right subtree\'s right child --AND-- comparing left subtree\'s right child with right subtree\'s left child\n    }\n};\n```
['C', 'C++']