Insertion of a Node in B-Tree happens at the leaf level.

Here are the steps:

1. Start from root, find leaf node where new key fits.
2. If the found leaf node has less than the maximum number of allowed keys, insert the new key at the right place.
3. If the found leaf node is full, split it into two nodes and promote the middle key to the node above. If the node above is full, split it and promote the middle key, and so on until you find a node that is not full.
4. If the root is full and is split, create a new root which has one key and two children.

Question

Insertion of a Node in B-Tree happens at the leaf level.

Here are the steps:

1. Start from root, find leaf node where new key fits.
2. If the found leaf node has less than the maximum number of allowed keys, insert the new key at the right place.
3. If the found leaf node is full, split it into two nodes and promote the middle key to the node above. If the node above is full, split it and promote the middle key, and so on until you find a node that is not full.
4. If the root is full and is split, create a new root which has one key and two children.

Knowee AI · Accepted Answer

Insertion of a Node in B-Tree happens at the leaf level.

Here are the steps:

1. Start from root, find leaf node where new key fits.
2. If the found leaf node has less than the maximum number of allowed keys, insert the new key at the right place.
3. If the found leaf node is full, split it into two nodes and promote the middle key to the node above. If the node above is full, split it and promote the middle key, and so on until you find a node that is not full.
4. If the root is full and is split, create a new root which has one key and two children.

Insertion of a Node in B-Tree happens at_________

Question

Solution

Similar Questions

Upgrade your grade with Knowee