void BPlusTree::Insert(int key , int value)
{
BTreeNode * node = GetLeafNode(key);
if(node == NULL)
{
root = new BTreeNode();
root->setLeaf(true);
root->InsertIntoLeafNode(key ,value);
return;
}
if(node->searchLeaf(key))
{
return;
}
if(node->isFull())
{
split(node ,key ,value);
}
else
{
node->InsertIntoLeafNode(key,value);
}
}
