如何在给定kdtree中的点的树索引的情况下检索该点的坐标？

class Node:
    def __init__(self, point, left=None, right=None):
        self.point = point
        self.left = left
        self.right = right

def build_kdtree(points, depth=0):
    if not points:
        return None

    axis = depth % len(points[0])
    points.sort(key=lambda point: point[axis])
    median = len(points) // 2

    return Node(
        points[median],
        build_kdtree(points[:median], depth + 1),
        build_kdtree(points[median + 1:], depth + 1)
    )

def search_kdtree(root, target, depth=0):
    if not root:
        return None

    axis = depth % len(target)
    if target == root.point:
        return root.point
    elif target[axis] < root.point[axis]:
        return search_kdtree(root.left, target, depth + 1)
    else:
        return search_kdtree(root.right, target, depth + 1)

# 示例用法
points = [(2,3), (5,4), (9,6), (4,7), (8,1), (7,2)]
kdtree = build_kdtree(points)
target = (9,6)
result = search_kdtree(kdtree, target)
print(result)  # 输出 (9, 6)