style: format code using clang-format

Author: YassaTalaat80

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

@@ -1,14 +1,15 @@
 package com.thealgorithms.datastructures.trees;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
+
 import org.junit.jupiter.api.Test;
 
 public class SegmentTree2DTest {
 
     @Test
     void testInitialEmptyQueries() {
         SegmentTree2D segmentTree = new SegmentTree2D(4, 4);
-        
+
         // Initial tree should return 0 for any query
         assertEquals(0, segmentTree.query(0, 4, 0, 4));
         assertEquals(0, segmentTree.query(1, 3, 1, 3));
@@ -17,22 +18,22 @@ void testInitialEmptyQueries() {
     @Test
     void testUpdateAndPointQuery() {
         SegmentTree2D segmentTree = new SegmentTree2D(5, 5);
-        
+
         segmentTree.update(2, 3, 10);
         segmentTree.update(0, 0, 5);
 
         // Querying single points [row, row+1) x [col, col+1)
         assertEquals(10, segmentTree.query(2, 3, 3, 4));
         assertEquals(5, segmentTree.query(0, 1, 0, 1));
-        
+
         // Empty point should be 0
         assertEquals(0, segmentTree.query(1, 2, 1, 2));
     }
 
     @Test
     void testSubmatrixQuery() {
         SegmentTree2D segmentTree = new SegmentTree2D(4, 4);
-        
+
         // Matrix simulation:
         // [1, 2, 0, 0]
         // [3, 4, 0, 0]
@@ -56,14 +57,14 @@ void testSubmatrixQuery() {
     @Test
     void testUpdateOverwriting() {
         SegmentTree2D segmentTree = new SegmentTree2D(3, 3);
-        
+
         segmentTree.update(1, 1, 5);
         assertEquals(5, segmentTree.query(1, 2, 1, 2));
 
         // Overwrite the same point
         segmentTree.update(1, 1, 20);
         assertEquals(20, segmentTree.query(1, 2, 1, 2));
-        
+
         // Full matrix sum should just be this point
         assertEquals(20, segmentTree.query(0, 3, 0, 3));
     }