Add files via upload

This repository contains a C++ implementation of a function to determine if a binary tree is symmetric (i.e., a mirror of itself). The algorithm uses a recursive approach to compare the left and right subtrees of the tree.

Key Features:
Definition of the binary tree node structure (TreeNode).
Recursive function isSymmetric to check for symmetry.
Efficient time complexity of 
𝑂
(
𝑛
)
O(n), where 
𝑛
n is the number of nodes in the tree.

Author: coderpheonix

101.Symmertic Tree.cpp

@@ -0,0 +1,24 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    bool isSymmetric(TreeNode* root) {
+        return isMirror(root, root); }
+
+        private :
+         bool isMirror(TreeNode* left, TreeNode* right)
+         {
+         if (!left && !right) return true;
+         if (!left || !right) return false;
+         return (left->val == right->val) && isMirror(left-> left, right-> right) && isMirror(left-> right, right->left);
+        }
+};