Format code with clang-format

Author: NithinU2802

src/main/java/com/thealgorithms/tree/HeavyLightDecomposition.java

@@ -32,7 +32,6 @@ public HeavyLightDecomposition(int n) {
         position = new int[n + 1];
         nodeValue = new int[n + 1];
         segmentTree = new int[4 * (n + 1)];
-        
         for (int i = 0; i <= n; i++) {
             tree[i] = new ArrayList<>();
             chainHead[i] = -1;
@@ -56,7 +55,6 @@ public void addEdge(int u, int v) {
     private void dfsSize(int node, int parentNode) {
         parent[node] = parentNode;
         subtreeSize[node] = 1;
-        
         for (int child : tree[node]) {
             if (child != parentNode) {
                 depth[child] = depth[node] + 1;
@@ -69,19 +67,16 @@ private void dfsSize(int node, int parentNode) {
     private void decompose(int node, int head) {
         chainHead[node] = head;
         position[node] = positionIndex++;
-        
         int heavyChild = -1, maxSubtreeSize = -1;
         for (int child : tree[node]) {
             if (child != parent[node] && subtreeSize[child] > maxSubtreeSize) {
                 heavyChild = child;
                 maxSubtreeSize = subtreeSize[child];
             }
         }
-        
         if (heavyChild != -1) {
             decompose(heavyChild, head);
         }
-        
         for (int child : tree[node]) {
             if (child != parent[node] && child != heavyChild) {
                 decompose(child, child);

src/test/java/com/thealgorithms/tree/HeavyLightDecompositionTest.java

@@ -1,10 +1,11 @@
 package com.thealgorithms.tree;
 
-import org.junit.jupiter.api.BeforeEach;
-import org.junit.jupiter.api.Test;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertTrue;
 
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
 class HeavyLightDecompositionTest {
 
     private HeavyLightDecomposition hld;