Example: Insertion of a key 33 into a B-Tree (w/split)

Step 1: Search first node for key closet to 33. Key 30 was determined.

Step 2: Node pointed through key 30, is searched for inserting 33. Node is split and 36 is shifted upwards.

Step 3: Key 33 is inserted among 32 and 35.

                                      Figure: A B-tree

Deletion of key from B-tree is not impossible, but care have to be taken to make sure that the properties of b-tree are maintained if the deletion decrease the number of keys into a node below the minimum degree of tree, this violation has to be connected by combining various nodes and possibly decreasing the height if the tree. If the key contain children, the children have to be rearranged.

Example (Searching of a B - Tree for key 21)

Step 1: Search for key 21 in first node. 21 are among 20 & 30.

Step2: Searching is conducted onto the nodes linked by 30.

                                Figure: A B-tree