Format code with prettier (#3375)

src/main/java/com/thealgorithms/devutils/nodes/LargeTreeNode.java

@@ -53,7 +53,11 @@ public class LargeTreeNode<E> extends TreeNode<E> {
      * @param childNodes {@link Collection} of child Nodes.
      * @see TreeNode#TreeNode(Object, Node)
      */
-    public LargeTreeNode(E data, LargeTreeNode<E> parentNode, Collection<LargeTreeNode<E>> childNodes) {
+    public LargeTreeNode(
+        E data,
+        LargeTreeNode<E> parentNode,
+        Collection<LargeTreeNode<E>> childNodes
+    ) {
         super(data, parentNode);
         this.childNodes = childNodes;
     }

src/main/java/com/thealgorithms/devutils/nodes/Node.java

@@ -20,8 +20,7 @@ public abstract class Node<E> {
     /**
      * Empty constructor.
      */
-    public Node() {
-    }
+    public Node() {}
 
     /**
      * Initializes the Nodes' data.

src/main/java/com/thealgorithms/devutils/nodes/SimpleTreeNode.java

@@ -57,7 +57,12 @@ public class SimpleTreeNode<E> extends TreeNode<E> {
      * @param rightNode Value to which the nodes' right child reference will be
      * set.
      */
-    public SimpleTreeNode(E data, SimpleTreeNode<E> parentNode, SimpleTreeNode<E> leftNode, SimpleTreeNode<E> rightNode) {
+    public SimpleTreeNode(
+        E data,
+        SimpleTreeNode<E> parentNode,
+        SimpleTreeNode<E> leftNode,
+        SimpleTreeNode<E> rightNode
+    ) {
         super(data, parentNode);
         this.leftNode = leftNode;
         this.rightNode = rightNode;

src/main/java/com/thealgorithms/devutils/searches/SearchAlgorithm.java

@@ -6,7 +6,6 @@ package com.thealgorithms.devutils.searches;
  * @author Podshivalov Nikita (https://github.com/nikitap492)
  */
 public interface SearchAlgorithm {
-
     /**
      * @param key is an element which should be found
      * @param array is an array where the element should be found