style: Apply clang-format to match repository style guide

- Format code according to .clang-format configuration
- Use single-line lambdas as allowed by AllowShortLambdasOnASingleLine: All
- Apply 4-space indentation
- Ensure proper line endings

Author: saikirankanakala

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

@@ -31,7 +31,7 @@ private CentroidDecomposition() {
     /**
      * Represents the centroid tree structure.
      */
-    public static class CentroidTree {
+    public static final class CentroidTree {
         private final int n;
         private final List<List<Integer>> adj;
         private final int[] parent;
@@ -104,7 +104,7 @@ private int getSubtreeSize(int u, int p) {
 
         /**
          * Finds the centroid of a subtree.
-         * A centroid is a node whose removal creates components with size ≤ totalSize/2.
+         * A centroid is a node whose removal creates components with size &lt;= totalSize/2.
          *
          * @param u current node
          * @param p parent node
@@ -153,7 +153,7 @@ public int size() {
 
         /**
          * Returns the centroid tree structure as a string.
-         * Format: node -> parent (or ROOT for root node)
+         * Format: node -&gt; parent (or ROOT for root node)
          *
          * @return string representation
          */
@@ -179,7 +179,7 @@ public String toString() {
      * @param n number of nodes (0-indexed: 0 to n-1)
      * @param edges list of edges where each edge is [u, v]
      * @return CentroidTree object
-     * @throws IllegalArgumentException if n <= 0 or edges is invalid
+     * @throws IllegalArgumentException if n &lt;= 0 or edges is invalid
      */
     public static CentroidTree buildFromEdges(int n, int[][] edges) {
         if (n <= 0) {

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

@@ -154,62 +154,46 @@ void testPathGraph() {
 
     @Test
     void testInvalidEmptyTree() {
-        assertThrows(IllegalArgumentException.class, () -> {
-            CentroidDecomposition.buildFromEdges(0, new int[][] {});
-        });
+        assertThrows(IllegalArgumentException.class, () -> { CentroidDecomposition.buildFromEdges(0, new int[][] {}); });
     }
 
     @Test
     void testInvalidNegativeNodes() {
-        assertThrows(IllegalArgumentException.class, () -> {
-            CentroidDecomposition.buildFromEdges(-1, new int[][] {});
-        });
+        assertThrows(IllegalArgumentException.class, () -> { CentroidDecomposition.buildFromEdges(-1, new int[][] {}); });
     }
 
     @Test
     void testInvalidNullEdges() {
-        assertThrows(IllegalArgumentException.class, () -> {
-            CentroidDecomposition.buildFromEdges(5, null);
-        });
+        assertThrows(IllegalArgumentException.class, () -> { CentroidDecomposition.buildFromEdges(5, null); });
     }
 
     @Test
     void testInvalidEdgeCount() {
         // Tree with n nodes must have n-1 edges
         int[][] edges = {{0, 1}, {1, 2}}; // 2 edges for 5 nodes (should be 4)
-        assertThrows(IllegalArgumentException.class, () -> {
-            CentroidDecomposition.buildFromEdges(5, edges);
-        });
+        assertThrows(IllegalArgumentException.class, () -> { CentroidDecomposition.buildFromEdges(5, edges); });
     }
 
     @Test
     void testInvalidEdgeFormat() {
         int[][] edges = {{0, 1, 2}}; // Edge with 3 elements instead of 2
-        assertThrows(IllegalArgumentException.class, () -> {
-            CentroidDecomposition.buildFromEdges(3, edges);
-        });
+        assertThrows(IllegalArgumentException.class, () -> { CentroidDecomposition.buildFromEdges(3, edges); });
     }
 
     @Test
     void testInvalidNodeInEdge() {
         int[][] edges = {{0, 5}}; // Node 5 doesn't exist in tree of size 3
-        assertThrows(IllegalArgumentException.class, () -> {
-            CentroidDecomposition.buildFromEdges(3, edges);
-        });
+        assertThrows(IllegalArgumentException.class, () -> { CentroidDecomposition.buildFromEdges(3, edges); });
     }
 
     @Test
     void testInvalidNodeQuery() {
         int[][] edges = {{0, 1}, {1, 2}};
         CentroidDecomposition.CentroidTree tree = CentroidDecomposition.buildFromEdges(3, edges);
 
-        assertThrows(IllegalArgumentException.class, () -> {
-            tree.getParent(-1);
-        });
+        assertThrows(IllegalArgumentException.class, () -> { tree.getParent(-1); });
 
-        assertThrows(IllegalArgumentException.class, () -> {
-            tree.getParent(5);
-        });
+        assertThrows(IllegalArgumentException.class, () -> { tree.getParent(5); });
     }
 
     @Test