Replace List in BFS with Queue (TheAlgorithms#3231)

xdavidliu · web-flow · commit 9e377755060f · 2022-08-28T05:46:58.000Z
diff --git a/src/main/java/com/thealgorithms/searches/BreadthFirstSearch.java b/src/main/java/com/thealgorithms/searches/BreadthFirstSearch.java
@@ -2,10 +2,11 @@
 
 import com.thealgorithms.searches.DepthFirstSearch.Node;
 
-import java.util.ArrayList;
+import java.util.ArrayDeque;
 import java.util.List;
 import java.util.Objects;
 import java.util.Optional;
+import java.util.Queue;
 
 /**
  * @author: caos321
@@ -18,18 +19,18 @@ public static Optional<Node> search(final Node node, final String name) {
             return Optional.of(node);
         }
 
-        List<Node> queue = new ArrayList<>(node.getSubNodes());
+        Queue<Node> queue = new ArrayDeque<>(node.getSubNodes());
 
         while (!queue.isEmpty()) {
-            final Node current = queue.get(0);
+            final Node current = queue.poll();
 
             if (current.getName().equals(name)) {
                 return Optional.of(current);
             }
 
             queue.addAll(current.getSubNodes());
 
-            queue.remove(0);
+            queue.remove();
         }
 
         return Optional.empty();
