Add k-d tree post

content/posts/2024-08-10-kd-tree/index.md

@@ -72,6 +72,13 @@ class KdLeafNode[T]:
 
     def __init__(self):
         self.points = {}
+
+    # Convenience constructor used when splitting a node
+    @classmethod
+    def from_items(cls, items: Iterable[tuple[Point, T]]) -> KdLeafNode[T]:
+        res = cls()
+        res.points.update(items)
+        return res
 ```
 
 #### Split node
@@ -110,13 +117,6 @@ class KdNode[T]:
     def __init__(self):
         self.inner = KdLeafNode()
 
-    # Convenience constructor used when splitting a node
-    @classmethod
-    def from_items(cls, items: Iterable[tuple[Point, T]]) -> KdNode[T]:
-        res = cls()
-        res.inner.points.update(items)
-        return res
-
 class KdTree[T]:
     _root: KdNode[T]
 
@@ -165,7 +165,7 @@ def split_leaf[T](node: KdLeafNode[T], axis: Axis) -> KdSplitNode[T]:
     return KdSplitNode(
         split_axis,
         mid,
-        (KdNode.from_items(left), KdNode.from_items(right)),
+        (KdLeafNode.from_items(left), KdLeafNode.from_items(right)),
     )
 
 class KdTree[T]: