Merge pull request #559 from Rituraj-13/symmetric_tree

Solution of Symmetric tree problem on Leetcode
codemistic · Oct 5, 2022 · 15aa990 · 15aa990
2 parents d349592 + e4ce10a
commit 15aa990
Show file tree

Hide file tree

Showing 7 changed files with 36 additions and 0 deletions.
diff --git a/CPP/LINKED LIST/CIRCULAR LINKED LIST/test4.bin b/CPP/LINKED LIST/CIRCULAR LINKED LIST/test4.bin
diff --git a/CPP/LINKED LIST/DOUBLY LINKED LIST/doublylinkedlistpractice.bin b/CPP/LINKED LIST/DOUBLY LINKED LIST/doublylinkedlistpractice.bin
diff --git a/CPP/LINKED LIST/SINGLY LINKED LIST/Maths For DSA/Sliding Window Problem/subarraysum.bin b/CPP/LINKED LIST/SINGLY LINKED LIST/Maths For DSA/Sliding Window Problem/subarraysum.bin
diff --git a/CPP/LINKED LIST/SINGLY LINKED LIST/Maths For DSA/Sliding Window Problem/subarraysum.exe b/CPP/LINKED LIST/SINGLY LINKED LIST/Maths For DSA/Sliding Window Problem/subarraysum.exe
diff --git a/CPP/LINKED LIST/SINGLY LINKED LIST/Maths For DSA/powerfunc.bin b/CPP/LINKED LIST/SINGLY LINKED LIST/Maths For DSA/powerfunc.bin
diff --git a/Leetcode-solutions/Symmetric_Tree/Readme.md b/Leetcode-solutions/Symmetric_Tree/Readme.md
@@ -0,0 +1,3 @@
+# Leetcode question #101
+
+[Click here to view the question on Leetcode.](https://leetcode.com/problems/symmetric-tree/)
diff --git a/Leetcode-solutions/Symmetric_Tree/Symmetric_Tree.cpp b/Leetcode-solutions/Symmetric_Tree/Symmetric_Tree.cpp
@@ -0,0 +1,33 @@
+
+
+ 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) {
+
+        if(!root)
+            return true;
+
+        return areMirror(root->left, root->right);
+
+    }
+
+    bool areMirror(TreeNode* t1, TreeNode* t2){
+        if(!t1 || !t2)
+            return (t1 == t2);
+
+        if(t1->val != t2->val) 
+            return false;
+
+        return ( areMirror(t1->left, t2->right) && areMirror(t1->right, t2->left) );
+
+    }
+};