✅✅C++ || Easy Solution || 💯💯Recursive Approach || Heavily Commented
\u2705\u2705C++ || Easy Solution || \uD83D\uDCAF\uD83D\uDCAFRecursive Approach || Heavily Commented\n# Please Upvote as it really motivates me\n\n\nclass Soluti
## **\u2705\u2705C++ || Easy Solution || \uD83D\uDCAF\uD83D\uDCAFRecursive Approach || Heavily Commented**\n# **Please Upvote as it really motivates me**\n\n```\nclass Solution {\npublic:\n    bool isEqual(TreeNode*r1,TreeNode*r2){\n        //if we have both root to nullptr then we will return true\n        //else we will be returning false\n        \n        if(!r1||!r2)\n            return r1==r2;\n        //if not null then we will check for the r1 and r2 values\n        if(r1->val==r2->val){\n        //we will check for the r1 left and r2 right because they will be on opposite sides\n            return isEqual(r1->left,r2->right)&&isEqual(r1->right,r2->left);\n        }\n        //if r1 val not equal to r2 val then return false\n        return false;\n    }\n    bool isSymmetric(TreeNode* root) {\n        //The Approach is simple i.e. we will have to check if \n            //1. the right and left is equal \n        return isEqual(root->left,root->right);\n    }\n};\n```\n\n![image](https://assets.leetcode.com/users/images/7f423b57-81a2-46ce-9ab2-72ad38f668f7_1675480558.466273.png)\n
['Recursion', 'C', 'C++']