Time: 1 ms (32.51%), Space: 38.5 MB (30.22%) - LeetHub

Author: monishasuthapalli

symmetric-tree/symmetric-tree.java

@@ -0,0 +1,32 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public boolean isSymmetric(TreeNode root) {
+        
+        return isMirror(root,root);
+        
+    }
+    
+    boolean isMirror(TreeNode t1,TreeNode t2)
+    {
+        if(t1==null&&t2==null)
+            return true;
+        if(t1==null||t2==null)
+            return false;
+        return (t1.val==t2.val)&&isMirror(t1.right,t2.left)&&isMirror(t1.left,t2.right);
+        
+    }
+}