jjh

Author: bm01wait

src/main/java/com/ctci/treesandgraphs/FirstCommonAncestorWithParentAccessTest.java

@@ -0,0 +1,17 @@
+package com.ctci.treesandgraphs;
+
+import com.ctci.linkedlists.RemoveDuplicates;
+import org.junit.runner.JUnitCore;
+import org.junit.runner.Result;
+import org.junit.runner.notification.Failure;
+
+public class FirstCommonAncestorWithParentAccessTest {
+    public static void main(String[] args) {
+        //testAssertions();
+        Result result = JUnitCore.runClasses(RemoveDuplicates.class);
+        for (Failure failure : result.getFailures()) {
+            System.out.println(failure.toString());
+        }
+        System.out.println("Result == "+result.wasSuccessful());
+    }
+}

src/main/java/com/ctci/treesandgraphs/ListOfDepthsTest.java

@@ -0,0 +1,17 @@
+package com.ctci.treesandgraphs;
+
+import com.ctci.linkedlists.RemoveDuplicates;
+import org.junit.runner.JUnitCore;
+import org.junit.runner.Result;
+import org.junit.runner.notification.Failure;
+
+public class ListOfDepthsTest {
+    public static void main(String[] args) {
+        //testAssertions();
+        Result result = JUnitCore.runClasses(RemoveDuplicates.class);
+        for (Failure failure : result.getFailures()) {
+            System.out.println(failure.toString());
+        }
+        System.out.println("Result == "+result.wasSuccessful());
+    }
+}

src/main/java/com/ctci/treesandgraphs/MinimalTreeTest.java

@@ -0,0 +1,17 @@
+package com.ctci.treesandgraphs;
+
+import com.ctci.linkedlists.RemoveDuplicates;
+import org.junit.runner.JUnitCore;
+import org.junit.runner.Result;
+import org.junit.runner.notification.Failure;
+
+public class MinimalTreeTest {
+    public static void main(String[] args) {
+        //testAssertions();
+        Result result = JUnitCore.runClasses(RemoveDuplicates.class);
+        for (Failure failure : result.getFailures()) {
+            System.out.println(failure.toString());
+        }
+        System.out.println("Result == "+result.wasSuccessful());
+    }
+}