C++ 7ms shortest solution
This question is just an another part of checking two same trees.we treat both left and right subtrees as different. Here we will need to compare left value of 
This question is just an another part of checking two same trees.we treat both left and right subtrees as different. Here we will need to compare left value of one tree with right value of another tree.\n```\nclass Solution {\nprivate:\n    bool isSameTree(TreeNode *p, TreeNode *q) {\n        if (p == NULL || q == NULL) return (p == q);\n        return (p->val == q->val && isSameTree(p->left, q->right) && isSameTree(p->right, q->left));\n    }\npublic:\n    bool isSymmetric(TreeNode* root) {\n        return isSameTree(root->left,root->right);\n    }\n};\n```\n**-->UPVOTE IF FOUND USEFUL OR LEARNED ANYTHING!!!**
['Recursion', 'C', 'C++']