BFS

Author: Lei Cao

algorithms-java/src/binaryTreeBFSTraversall/TreeNode.java renamed to algorithms-java/src/binaryTreeBFSTraversal/TreeNode.java

@@ -1,4 +1,4 @@
-package binaryTreeBFSTraversall;
+package binaryTreeBFSTraversal;
 
 /**
  * Created by leicao on 5/10/15.

algorithms-java/src/binaryTreeBFSTraversall/binaryTreeBFSTraversall.java renamed to algorithms-java/src/binaryTreeBFSTraversal/binaryTreeBFSTraversal.java

@@ -1,4 +1,4 @@
-package binaryTreeBFSTraversall;
+package binaryTreeBFSTraversal;
 
 import java.util.ArrayList;
 import java.util.LinkedList;
@@ -8,7 +8,7 @@
 /**
  * Created by leicao on 5/10/15.
  */
-public class binaryTreeBFSTraversall {
+public class binaryTreeBFSTraversal {
     public List<Integer> bfsTraversal(TreeNode root) {
         List<Integer>  results = new ArrayList<Integer>();
         if (root == null) {

algorithms-java/src/binaryTreeBFSTraversall/binaryTreeBFSTraversallTest.java renamed to algorithms-java/src/binaryTreeBFSTraversal/binaryTreeBFSTraversalTest.java

@@ -1,4 +1,4 @@
-package binaryTreeBFSTraversall;
+package binaryTreeBFSTraversal;
 
 import org.junit.Test;
 
@@ -10,7 +10,7 @@
 /**
  * Created by leicao on 6/10/15.
  */
-public class binaryTreeBFSTraversallTest {
+public class binaryTreeBFSTraversalTest {
 
     /**
      *          0
@@ -60,7 +60,7 @@ public void testPreorderTraversal() throws Exception {
             }});
         }};
 
-        binaryTreeBFSTraversall b = new binaryTreeBFSTraversall();
+        binaryTreeBFSTraversal b = new binaryTreeBFSTraversal();
         for (int i = 0; i < results.size(); i++) {
             List<Integer> r = b.bfsTraversal(inputes.get(i));
             assertEquals(results.get(i), r);