C++ || 4 MS || EASY TO UNDERSTAND
\tclass Solution {\n\tpublic:\n\t\tbool isSymmetric(TreeNode root) {\n\t\t\treturn (root==NULL || isSymmetricHelp(root->left,root->right));\n\t\t}\n\t\tbool isS
\tclass Solution {\n\tpublic:\n\t\tbool isSymmetric(TreeNode* root) {\n\t\t\treturn (root==NULL || isSymmetricHelp(root->left,root->right));\n\t\t}\n\t\tbool isSymmetricHelp(TreeNode*left,TreeNode*right){\n\t\t\tif(left==NULL || right==NULL)\n\t\t\t\treturn left==right;\n\t\t\tif(left->val != right->val)\n\t\t\t\treturn false;\n\t\t\treturn isSymmetricHelp(left->left,right->right) && isSymmetricHelp(left->right,right->left);\n\t\t}\n\t};\n\t\n\tTC : O(N)\n\n\tfeel free to ask your doubts :)\n\tand pls upvote if it was helpful :)
['Recursion', 'C']