B *（星形）树插入方法问题C＃

Question

有人可以帮助我在C＃中实现 B （star）*树插入方法吗？

这是一个有效的 B树实现，但是我需要对子级进行修改以使 B星状树正常工作。

我了解将节点拆分为 2/3填充的逻辑，但是我无法在代码中实现

private void InsertNode(Node current, int value)
{
    Node temp = root;

    if (current.Size == (2 * minDegree) - 1)
    {
        Node newRoot = new Node(minDegree);
        root = newRoot;
        newRoot.IsLeaf = false;
        newRoot.Size = 0;
        newRoot.Children[0] = temp;
        SplitChild(newRoot, 0);
        InsertNonFull(newRoot, value);
    }
    else
    {
        InsertNonFull(current, value);
    }
}

private void InsertNonFull(Node current, int value)
{
    int i = current.Size - 1;

    if (current.IsLeaf)
    {
        while (i >= 0 && value < current.Keys[i])
        {
            current.Keys[i + 1] = current.Keys[i];
            i -= 1;
        }
        current.Keys[i + 1] = value;
        current.Size += 1;
    }
    else
    {
        while (i >= 0 && value < current.Keys[i])
        {
            i -= 1;
        }
        i += 1;

        if (current.Children[i].Size == (2 * minDegree) - 1)
        {
            SplitChild(current, i);
            if (value > current.Keys[i])
            {
                i += 1;
            }
        }
        InsertNonFull(current.Children[i], value);
    }
}

private void SplitChild(Node nonFullParent, int indexOfFullChild)
{
    Node newNode = new Node(minDegree);
    Node fullChild = nonFullParent.Children[indexOfFullChild];

    newNode.IsLeaf = fullChild.IsLeaf;
    newNode.Size = minDegree - 1;

    for (int i = 0; i < minDegree - 1; i++)
    {
        newNode.Keys[i] = fullChild.Keys[i + minDegree];
    }

    if (!fullChild.IsLeaf)
    {
        for (int i = 0; i < minDegree; i++)
        {
            newNode.Children[i] = fullChild.Children[i + minDegree];
        }
    }

    fullChild.Size = minDegree - 1;

    for (int i = nonFullParent.Size; i == indexOfFullChild + 1; i--)
    {
        nonFullParent.Children[i + 1] = nonFullParent.Children[i];
    }
    nonFullParent.Children[indexOfFullChild + 1] = newNode;

    for (int i = nonFullParent.Size; i == indexOfFullChild; i--)
    {
        nonFullParent.Keys[i + 1] = nonFullParent.Keys[i];
    }
    nonFullParent.Keys[indexOfFullChild] = fullChild.Keys[minDegree - 1];
    nonFullParent.Size = nonFullParent.Size + 1;
}