matrix-revolution
diff --git a/‎src/main/java/com/fishercoder/solutions/_101.java
Lines changed: 17 additions & 13 deletions b/‎src/main/java/com/fishercoder/solutions/_101.java
Lines changed: 17 additions & 13 deletions
diff --git a/‎src/test/java/com/fishercoder/_101Test.java
Lines changed: 32 additions & 0 deletions b/‎src/test/java/com/fishercoder/_101Test.java
Lines changed: 32 additions & 0 deletions
@@ -23,22 +23,26 @@ Given a binary tree, check whether it is a mirror of itself (ie, symmetric aroun
    3    3
 
 Note:
-Bonus points if you could solve it both recursively and iteratively. */
+Bonus points if you could solve it both recursively and iteratively.
+ */
+
 public class _101 {
-
public boolean isSymmetric(TreeNode root) {	public boolean isSymmetric(TreeNode root) {
-		if (root == null) {
-			return true;
+	public static class Solution1 {
+		public boolean isSymmetric(TreeNode root) {
+			if (root == null) {
+				return true;
+			}
+			return isSymmetric(root.left, root.right);
 		}
-		return isSymmetric(root.left, root.right);
-	}
 
-	private boolean isSymmetric(TreeNode left, TreeNode right) {
-		if (left == null || right == null) {
-			return left == right;
-		}
-		if (left.val != right.val) {
-			return false;
+		private boolean isSymmetric(TreeNode left, TreeNode right) {
+			if (left == null || right == null) {
+				return left == right;
+			}
+			if (left.val != right.val) {
+				return false;
+			}
+			return isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);
 		}
-		return isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);
 	}
 }
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._101;
+import java.util.Arrays;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _101Test {
+  private static _101.Solution1 solution1;
+  private static TreeNode root;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _101.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 2, 3, 4, 4, 3));
+    assertEquals(true, solution1.isSymmetric(root));
+  }
+
+  @Test
+  public void test2() {
+    root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 2, null, 3, null, 3));
+    assertEquals(false, solution1.isSymmetric(root));
+  }
+}