add unit test for data structures(week 1)

Viscaria233 · Viscaria233 · commit 2cff6559f852 · 2017-02-24T14:37:25.000+08:00
diff --git a/group01/895457260/code/src/datastructure/basic/BinarySortedTree.java b/group01/895457260/code/src/datastructure/basic/BinarySortedTree.java
@@ -8,17 +8,17 @@ public class BinarySortedTree<T extends Comparable> {
 
     private BinaryTreeNode root = null;
 
-    public void traversal(Visitor visitor) {
-        traversal(root, visitor);
+    public void traverse(Visitor visitor) {
+        traverse(root, visitor);
     }
 
-    private void traversal(BinaryTreeNode node, Visitor visitor) {
+    private void traverse(BinaryTreeNode node, Visitor visitor) {
         if (node == null) {
             return;
         }
-        traversal(node.getLeft(), visitor);
+        traverse(node.getLeft(), visitor);
         visitor.visit(node);
-        traversal(node.getRight(), visitor);
+        traverse(node.getRight(), visitor);
     }
 
     public interface Visitor {
diff --git a/group01/895457260/code/src/test/datastructure/basic/BinarySortedTreeTest.java b/group01/895457260/code/src/test/datastructure/basic/BinarySortedTreeTest.java
@@ -43,7 +43,7 @@ public void testAdd() throws Exception {
         final Object[] left = new Object[addValues.length];
         final Object[] value = new Object[addValues.length];
         final Object[] right = new Object[addValues.length];
-        tree.traversal(new BinarySortedTree.Visitor() {
+        tree.traverse(new BinarySortedTree.Visitor() {
             int pos = 0;
             @Override
             public void visit(BinaryTreeNode node) {
diff --git a/group01/895457260/code/src/test/datastructure/basic/TestSuite.java b/group01/895457260/code/src/test/datastructure/basic/TestSuite.java
@@ -10,4 +10,4 @@
 @RunWith(Suite.class)
 @Suite.SuiteClasses({ArrayListTest.class, LinkedListTest.class,
         BinarySortedTreeTest.class, QueueTest.class, StackTest.class})
-public class DataStructureTestSuite {}
+public class TestSuite {}

Original file line number	Diff line number	Diff line change
`@@ -8,17 +8,17 @@ public class BinarySortedTree<T extends Comparable> {`
`8`	`8`
`9`	`9`	`private BinaryTreeNode root = null;`
`10`	`10`
`11`		`- public void traversal(Visitor visitor) {`
`12`		`- traversal(root, visitor);`
	`11`	`+ public void traverse(Visitor visitor) {`
	`12`	`+ traverse(root, visitor);`
`13`	`13`	`}`
`14`	`14`
`15`		`- private void traversal(BinaryTreeNode node, Visitor visitor) {`
	`15`	`+ private void traverse(BinaryTreeNode node, Visitor visitor) {`
`16`	`16`	`if (node == null) {`
`17`	`17`	`return;`
`18`	`18`	`}`
`19`		`- traversal(node.getLeft(), visitor);`
	`19`	`+ traverse(node.getLeft(), visitor);`
`20`	`20`	`visitor.visit(node);`
`21`		`- traversal(node.getRight(), visitor);`
	`21`	`+ traverse(node.getRight(), visitor);`
`22`	`22`	`}`
`23`	`23`
`24`	`24`	`public interface Visitor {`