Insertion in a B-Tree (pseudo code)

• insert newEntry in the appropriate leaf;

• currentNode = leaf;

• while (currentNode overflow)

split the currentNode into two nodes

on the same level, and promote median key up

to the parent of currentNode;

currentNode := parent of currentNode;

Previous slide

Next slide

Back to first slide

View graphic version