[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/kd_tree/nearest_neighbour_search.py

@@ -1,9 +1,9 @@
 from typing import Optional, List, Tuple
 from .kd_node import KDNode
 
+
 def nearest_neighbour_search(
-        root: Optional[KDNode],
-        query_point: List[float]
+    root: Optional[KDNode], query_point: List[float]
 ) -> Tuple[Optional[List[float]], float, int]:
     """
     Performs a nearest neighbor search in a KD-Tree for a given query point.
@@ -44,7 +44,8 @@ def search(node: Optional[KDNode], depth: int = 0) -> None:
         # Calculate the current distance (squared distance)
         current_point = node.point
         current_dist = sum(
-            (query_coord - point_coord) ** 2 for query_coord, point_coord in zip(query_point, current_point)
+            (query_coord - point_coord) ** 2
+            for query_coord, point_coord in zip(query_point, current_point)
         )
 
         # Update nearest point if the current node is closer