好的，下面是一个简单的四叉树 Python 代码实现的例子：

```python class QuadTreeNode: def init(self, x, y, width, height): self.x = x self.y = y self.width = width self.height = height self.points = [] self.children = [None, None, None, None]

def insert(self, point):
    if len(self.children[0]) > 0:
        # 如果有子节点，则将点插入到合适的子节点中
        index = self.get_index(point)
        if index != -1:
            self.children[index].insert(point)
            return
    
    # 如果没有子节点或者点不在子节点范围内，则将点插入到当前节点中
    self.points.append(point)
    
    # 如果当前节点中的点数量超过了设定的阈值，则将当前节点分裂成四个子节点
    if len(self.points) > MAX_POINTS_PER_NODE:
        self.split()

def split(self):
    half_width = self.width / 2
    half_height = self.height / 2
    x = self.x
    y = self.y
    
    # 创建四个子节点
    self.children[0] = QuadTreeNode(x, y, half_width, half_height)
    self.children[1] = QuadTreeNode(x + half_width, y, half_width, half_height)
    self.children[2] = QuadTreeNode(x, y + half_height, half_width, half_height)
    self.children[3] = QuadTreeNode(x + half_width, y + half_height, half_width, half_height)
    
    # 将当前节点中的点插入到合适的子节点中
    for p in self.points:
        index = self.get_index(p)
        if index != -1:
            self.children[index].insert(p)
    
    # 清空当前节点中的点
    self.points.clear()

def get_index(self, point):
    """返回点所在的子节点的编号