Fixed test cases

Author: manishraj27

src/main/java/com/thealgorithms/searches/BreadthFirstSearch.java

@@ -12,11 +12,10 @@
 /**
  * Breadth-First Search implementation for tree/graph traversal.
  * @author caos321
- * @co-author manishraj27
+ * @co-author @manishraj27
  * @see <a href="https://en.wikipedia.org/wiki/Breadth-first_search">Breadth-first search</a>
  */
 public class BreadthFirstSearch<T> {
-
     private final List<T> visited = new ArrayList<>();
     private final Set<T> visitedSet = new HashSet<>();
 
@@ -28,46 +27,30 @@ public class BreadthFirstSearch<T> {
      * @return Optional containing the found node, or empty if not found
      */
     public Optional<Node<T>> search(final Node<T> root, final T value) {
-        // Handle null root
         if (root == null) {
             return Optional.empty();
         }
 
-        // Check root value first
-        if (value == null) {
-            if (root.getValue() == null) {
-                visited.add(null);
-                return Optional.of(root);
-            }
-            visited.add(root.getValue());
-            return Optional.empty();
-        }
+        visited.add(root.getValue());
+        visitedSet.add(root.getValue());
 
-        // Check root node
-        if (value.equals(root.getValue())) {
-            visited.add(root.getValue());
+        if (root.getValue() == value) {
             return Optional.of(root);
         }
 
-        // Add root to visited
-        visited.add(root.getValue());
-        visitedSet.add(root.getValue());
-
-        // Process remaining nodes
         Queue<Node<T>> queue = new ArrayDeque<>(root.getChildren());
         while (!queue.isEmpty()) {
             final Node<T> current = queue.poll();
             T currentValue = current.getValue();
-            
-            // Skip if already visited
+
             if (visitedSet.contains(currentValue)) {
                 continue;
             }
 
             visited.add(currentValue);
             visitedSet.add(currentValue);
 
-            if (value.equals(currentValue)) {
+            if (currentValue == value || (value != null && value.equals(currentValue))) {
                 return Optional.of(current);
             }