100 (3) update tests

stevencooks · stevencooks · commit 3cc9d5d3e9b1 · 2015-11-17T15:13:41.000-05:00
diff --git a/src/_100_SameTree/Solution.java b/src/_100_SameTree/Solution.java
@@ -1,7 +1,7 @@
 /**
  * Time : O(N); Space: O(1)
  * @tag : Tree; Depth-First-Search
- * @date: 04.27.2015 
+ * @date: Apr 27, 2015 
  *************************************************************************
  * Description: 
  * 
@@ -18,6 +18,7 @@
 
 /** see test {@link _100_SameTree.SolutionTest } */
 public class Solution {
+
     public boolean isSameTree(TreeNode p, TreeNode q) {
         if (p == null && q == null) {
             return true;
@@ -30,4 +31,5 @@ public boolean isSameTree(TreeNode p, TreeNode q) {
             return false;
         }
     }
+
 }
diff --git a/test/_100_SameTree/PracticeTest.java b/test/_100_SameTree/PracticeTest.java
@@ -32,44 +32,39 @@ public void tearDown() throws Exception {
     public void Test0() {
         TreeNode p = null;
         TreeNode q = null;
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("null trees", actual);
+        assertTrue(solution.isSameTree(p, q));
     }
 
-    // 1 1
+    // 1  1
     @Test
     public void Test1() {
         TreeNode p = new TreeNode(1);
         TreeNode q = new TreeNode(1);
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("only-root trees", actual);
+        assertTrue(solution.isSameTree(p, q));
     }
 
-    // 1 2
+    // 1  2
     @Test
     public void Test2() {
         TreeNode p = new TreeNode(1);
         TreeNode q = new TreeNode(2);
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("only-root trees", !actual);
+        assertFalse(solution.isSameTree(p, q));
     }
 
     // 1 null
     @Test
     public void Test3() {
         TreeNode p = new TreeNode(1);
         TreeNode q = null;
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("one-is-null-trees", !actual);
+        assertFalse(solution.isSameTree(p, q));
     }
 
     // null 1
     @Test
     public void Test4() {
         TreeNode p = null;
         TreeNode q = new TreeNode(1);
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("one-is-null-trees", !actual);
+        assertTrue(!solution.isSameTree(p, q));
     }
 
     //   1      1
@@ -81,8 +76,7 @@ public void Test5() {
         TreeNode q = new TreeNode(1);
         TreeNode.connect(p, new TreeNode(2), new TreeNode(3));
         TreeNode.connect(q, new TreeNode(2), new TreeNode(3));
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("balanced-trees", actual);
+        assertTrue(solution.isSameTree(p, q));
     }
 
     //   1      1
@@ -94,8 +88,7 @@ public void Test6() {
         TreeNode q = new TreeNode(1);
         TreeNode.connect(p, new TreeNode(4), new TreeNode(3));
         TreeNode.connect(q, new TreeNode(2), new TreeNode(5));
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("balanced-trees", !actual);
+        assertTrue(!solution.isSameTree(p, q));
     }
 
     //   1       1
@@ -111,8 +104,7 @@ public void Test7() {
         TreeNode node2 = new TreeNode(2);
         TreeNode.connect(q, node2, new TreeNode(3));
         TreeNode.connect(node2, new TreeNode(4), null);
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("different depth", !actual);
+        assertTrue(!solution.isSameTree(p, q));
     }
 
 }
diff --git a/test/_100_SameTree/SolutionTest.java b/test/_100_SameTree/SolutionTest.java
@@ -32,44 +32,39 @@ public void tearDown() throws Exception {
     public void Test0() {
         TreeNode p = null;
         TreeNode q = null;
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("null trees", actual);
+        assertTrue(solution.isSameTree(p, q));
     }
 
-    // 1 1
+    // 1  1
     @Test
     public void Test1() {
         TreeNode p = new TreeNode(1);
         TreeNode q = new TreeNode(1);
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("only-root trees", actual);
+        assertTrue(solution.isSameTree(p, q));
     }
 
-    // 1 2
+    // 1  2
     @Test
     public void Test2() {
         TreeNode p = new TreeNode(1);
         TreeNode q = new TreeNode(2);
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("only-root trees", !actual);
+        assertFalse(solution.isSameTree(p, q));
     }
 
     // 1 null
     @Test
     public void Test3() {
         TreeNode p = new TreeNode(1);
         TreeNode q = null;
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("one-is-null-trees", !actual);
+        assertFalse(solution.isSameTree(p, q));
     }
 
     // null 1
     @Test
     public void Test4() {
         TreeNode p = null;
         TreeNode q = new TreeNode(1);
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("one-is-null-trees", !actual);
+        assertTrue(!solution.isSameTree(p, q));
     }
 
     //   1      1
@@ -81,8 +76,7 @@ public void Test5() {
         TreeNode q = new TreeNode(1);
         TreeNode.connect(p, new TreeNode(2), new TreeNode(3));
         TreeNode.connect(q, new TreeNode(2), new TreeNode(3));
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("balanced-trees", actual);
+        assertTrue(solution.isSameTree(p, q));
     }
 
     //   1      1
@@ -94,8 +88,7 @@ public void Test6() {
         TreeNode q = new TreeNode(1);
         TreeNode.connect(p, new TreeNode(4), new TreeNode(3));
         TreeNode.connect(q, new TreeNode(2), new TreeNode(5));
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("balanced-trees", !actual);
+        assertTrue(!solution.isSameTree(p, q));
     }
 
     //   1       1
@@ -111,8 +104,7 @@ public void Test7() {
         TreeNode node2 = new TreeNode(2);
         TreeNode.connect(q, node2, new TreeNode(3));
         TreeNode.connect(node2, new TreeNode(4), null);
-        boolean actual = solution.isSameTree(p, q);
-        assertTrue("different depth", !actual);
+        assertTrue(!solution.isSameTree(p, q));
     }
 
 }

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`/**`
`2`	`2`	`* Time : O(N); Space: O(1)`
`3`	`3`	`* @tag : Tree; Depth-First-Search`
`4`		`- * @date: 04.27.2015`
	`4`	`+ * @date: Apr 27, 2015`
`5`	`5`	`*************************************************************************`
`6`	`6`	`* Description:`
`7`	`7`	`*`
`@@ -18,6 +18,7 @@`
`18`	`18`
`19`	`19`	`/** see test {@link _100_SameTree.SolutionTest } */`
`20`	`20`	`public class Solution {`
	`21`	`+`
`21`	`22`	`public boolean isSameTree(TreeNode p, TreeNode q) {`
`22`	`23`	`if (p == null && q == null) {`
`23`	`24`	`return true;`
`@@ -30,4 +31,5 @@ public boolean isSameTree(TreeNode p, TreeNode q) {`
`30`	`31`	`return false;`
`31`	`32`	`}`
`32`	`33`	`}`
	`34`	`+`
`33`	`35`	`}`