format modification

Author: xuyang471

src/main/java/com/thealgorithms/datastructures/trees/BoundaryTraversal.java

@@ -1,9 +1,13 @@
 package com.thealgorithms.datastructures.trees;
 
-import java.util.*;
-
-/**BoundaryTraversal
- *
+import java.util.ArrayList;
+import java.util.Deque;
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * BoundaryTraversal
+ * <p>
  * Start with the Root:
  * Add the root node to the boundary list.
  * Traverse the Left Boundary (Excluding Leaf Nodes):
@@ -19,7 +23,8 @@
  * The final boundary list contains the root, left boundary, leaf nodes, and reversed right boundary in that order.
  */
 public final class BoundaryTraversal {
-    private BoundaryTraversal() {}
+    private BoundaryTraversal() {
+    }
 
     // Main function for boundary traversal, returns a list of boundary nodes in order
     public static List<Integer> boundaryTraversal(BinaryTree.Node root) {

src/test/java/com/thealgorithms/datastructures/trees/BoundaryTraversalTest.java

@@ -1,10 +1,11 @@
 package com.thealgorithms.datastructures.trees;
 
-import static org.junit.jupiter.api.Assertions.assertEquals;
+import org.junit.jupiter.api.Test;
 
 import java.util.Collections;
 import java.util.List;
-import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  *
@@ -27,6 +28,7 @@ public void testSingleNodeTree() {
         assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
         assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
     }
+
     /*
         1
        / \
@@ -37,7 +39,7 @@ public void testSingleNodeTree() {
     */
     @Test
     public void testCompleteBinaryTree() {
-        final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {
+        final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{
                 1, 2, 3, 4, 5, 6, 7
         });
 
@@ -46,6 +48,7 @@ public void testCompleteBinaryTree() {
         assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
         assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
     }
+
     /*
         1
        / \
@@ -61,7 +64,7 @@ public void testCompleteBinaryTree() {
     */
     @Test
     public void testBoundaryTraversal() {
-        final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {
+        final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{
                 1, 2, 7, 3, null, null, 8, null, 4, 9, null, 5, 6, 10, 11
         });
 
@@ -70,6 +73,7 @@ public void testBoundaryTraversal() {
         assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
         assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
     }
+
     /*
           1
          /
@@ -81,13 +85,14 @@ public void testBoundaryTraversal() {
     */
     @Test
     public void testLeftSkewedTree() {
-        final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {1,2,null,3,null,4,null});
+        final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{1, 2, null, 3, null, 4, null});
 
-        List<Integer> expected = List.of(1,2,3,4);
+        List<Integer> expected = List.of(1, 2, 3, 4);
 
         assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
         assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
     }
+
     /*
               5
                \
@@ -99,9 +104,9 @@ public void testLeftSkewedTree() {
     */
     @Test
     public void testRightSkewedTree() {
-        final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {5,null,6,null,7,null,8});
+        final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{5, null, 6, null, 7, null, 8});
 
-        List<Integer> expected = List.of(5, 6, 7,8);
+        List<Integer> expected = List.of(5, 6, 7, 8);
 
         assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
         assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));