refactor 101

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_101.java

@@ -2,45 +2,20 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**
- * 101. Symmetric Tree
-
-Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
-
-For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
-
-    1
-   / \
-  2   2
- / \ / \
-3  4 4  3
-
-But the following [1,2,2,null,3,null,3] is not:
-
-    1
-   / \
-  2   2
-   \   \
-   3    3
-
-Note:
-Bonus points if you could solve it both recursively and iteratively.
- */
-
 public class _101 {
-	public static class Solution1 {
-		public boolean isSymmetric(TreeNode root) {
-			if (root == null) {
-				return true;
-			}
-			return isSymmetric(root.left, root.right);
-		}
-
-		private boolean isSymmetric(TreeNode left, TreeNode right) {
-			if (left == null || right == null) {
-				return left == right;
-			}
-			return left.val == right.val && isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);
-		}
-	}
+    public static class Solution1 {
+        public boolean isSymmetric(TreeNode root) {
+            if (root == null) {
+                return true;
+            }
+            return isSymmetric(root.left, root.right);
+        }
+
+        private boolean isSymmetric(TreeNode left, TreeNode right) {
+            if (left == null || right == null) {
+                return left == right;
+            }
+            return left.val == right.val && isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);
+        }
+    }
 }