Test

src/main/java/fr/univamu/progav/td1/BreadthFirstSearch.java

@@ -16,14 +16,23 @@ public class BreadthFirstSearch {
     List<Tree> currentLevel = new ArrayList<>();
     currentLevel.add(root);
     while (!currentLevel.isEmpty()) {
-      List<Tree> nextLevel = new ArrayList<>();
-      for (Tree tree : currentLevel) {
-        orderedValue.add(tree.getValue());
-        for (Tree child : tree.getChildren()) {
-           nextLevel.add(child);
-        }
-      }
-      currentLevel = nextLevel;
+      currentLevel = computeNextLevel(currentLevel);
+    }
+  }
+
+  private List<Tree> computeNextLevel(List<Tree> currentLevel) {
+    List<Tree> nextLevel = new ArrayList<>();
+    for (Tree tree : currentLevel) {
+      orderedValue.add(tree.getValue());
+      addAllChildren(tree, nextLevel);
+    }
+    currentLevel = nextLevel;
+    return currentLevel;
+  }
+
+  private static void addAllChildren(Tree tree, List<Tree> nextLevel) {
+    for (Tree child : tree.getChildren()) {
+       nextLevel.add(child);
     }
   }