b+树 linux

class BPlusTreeNode:
    def __init__(self, is_leaf=False, max_keys=3):
        self.is_leaf = is_leaf
        self.keys = []
        self.children = []
        self.max_keys = max_keys

    def insert_in_leaf(self, key, value):
        index = 0
        while index < len(self.keys) and self.keys[index] < key:
            index += 1
        self.keys.insert(index, key)
        self.children.insert(index, value)

    def split(self):
        new_node = BPlusTreeNode(is_leaf=self.is_leaf, max_keys=self.max_keys)
        mid = len(self.keys) // 2
        new_node.keys = self.keys[mid:]
        new_node.children = self.children[mid:]
        self.keys = self.keys[:mid]
        self.children = self.children[:mid]
        return new_node

# 示例插入操作
root = BPlusTreeNode(is_leaf=True, max_keys=3)
root.insert_in_leaf(10, "data1")
root.insert_in_leaf(20, "data2")
root.insert_in_leaf(30, "data3")
root.insert_in_leaf(40, "data4")

# 节点分裂
new_node = root.split()
print("Root keys:", root.keys)
print("New node keys:", new_node.keys)