B-Tree Insert and Delete Demo

Demo
• Demo slide by: Dr. J. Johnson
 Constructing a B-tree
• Suppose we start with an empty B-tree and keys arrive
in the following order:1 12 8 2 25 6 14 28 17 7 52
16 48 68 3 26 29 53 55 45
• We want to construct a B-tree of order 5
• The first four items go into the root:

1 2 8 12

• To put the fifth item in the root would violate condition

4
• Therefore, when 25 arrives, pick the middle key to
make a new root
 1
12
8
Constructing a B-tree
2
25 Add 25 to the tree
6
14
28
17
7
52 Exceeds Order.
16 Promote middle and
48 split.
68 1 2 8 12 25
3
26
29
53
55
45
 1
12
8
Constructing a B-tree (contd.)
2
25
6 8
14
28
17
7
52 1 2 12 25
16
48 6, 14, 28 get added to the leaf nodes:
68
3 8
26
29
53
55
45 1 2 1 6 2 12 14
25 28
 1
12
8
Constructing a B-tree (contd.)
2
25
6 Adding 17 to the right leaf node would over-fill it, so we take
14 the middle key, promote it (to the root) and split the leaf
28
17
7 8
52
16
48
68
3 1 2 6
2 25 28 28
12 14 17
26
29
53
55
45
 1
12
8
Constructing a B-tree (contd.)
2
25 7, 52, 16, 48 get added to the leaf nodes
6
14
28
17
7 8 17
52
16
48
68
3 1 2 76 12 14
16 25 28 52
48
26
29
53
55
45
 1
12
8
Constructing a B-tree (contd.)
2
25
6 Adding 68 causes us to split the right most leaf,
14 promoting 48 to the root
28
17
7
52
16
48 8 17
68
3
26
29 1 2 6 7 12 14 16 25 28 48 52 68
53
55
45
 1
12
8
Constructing a B-tree (contd.)
2
25
6 Adding 3 causes us to split the left most leaf
14
28
17 8 17 48
7
52
16
48
68 1 2
3 6 7 12 14 16 25 28 52 68
3
26
29
53
55
45
 1
12
8
Constructing a B-tree (contd.)
2
25
6 Add 26, 29, 53, 55 then go into the leaves
14
28
17 3 8 17 48
7
52
16
48
68 1 2 6 7 12 14 16 25262829 52536855
3
26
29
53
55
45
 1
12
8
Constructing a B-tree (contd.)
2
25 Exceeds Order.
6 Add 45 increases the trees level Promote middle and
14 split.
28
17
7
52 Exceeds Order.
16 Promote middle and
3 8 17 48 split.
48
68
3
26
29 1 2 6 7 12 14 16 25 26 28 29 45 52 53 55 68
53
55
45
 Exercise in Inserting a B-Tree
• Insert the following keys to a 5-way B-tree:
• 3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 8, 19, 4,
31, 35, 56
Answer to Exercise

Java Applet Source

 Delete from a B-tree
• During insertion, the key always goes into a leaf.
For deletion we wish to remove from a leaf.
There are three possible ways we can do this:
• 1 - If the key is already in a leaf node, and
removing it doesn’t cause that leaf node to have
too few keys, then simply remove the key to be
deleted.
• 2 - If the key is not in a leaf then it is guaranteed
(by the nature of a B-tree) that its predecessor or
successor will be in a leaf -- in this case can we
delete the key and promote the predecessor or
successor key to the non-leaf deleted key’s
position.
 Removal from a B-tree (2)
• If (1) or (2) lead to a leaf node containing less than the
minimum number of keys then we have to look at the
siblings immediately adjacent to the leaf in question:
– 3: if one of them has more than the min’ number of keys
then we can promote one of its keys to the parent and
take the parent key into our lacking leaf
– 4: if neither of them has more than the min’ number of
keys then the lacking leaf and one of its neighbours can be
combined with their shared parent (the opposite of
promoting a key) and the new leaf will have the correct
number of keys; if this step leave the parent with too few
keys then we repeat the process up to the root itself, if
required
 Type #1: Simple leaf deletion

Assuming a 5-way
B-Tree, as before... 12 29 52

2 7 9 15 22 31 43 56 69 72

Delete 2: Since there are enough

keys in the node, just delete it
Note when printed: this slide is animated
Type #2: Simple non-leaf deletion

12 29 56
52 Delete 52

7 9 15 22 31 43 56 69 72

Borrow the predecessor

or (in this case) successor

Note when printed: this slide is animated

Type #4: Too few keys in node and its
siblings

12 29 56

Join back together

7 9 15 22 31 43 69 72
Too few keys!
Delete 72

Note when printed: this slide is animated

Type #4: Too few keys in node and its
siblings

12 29

7 9 15 22 31 43 56 69

Note when printed: this slide is animated

Type #3: Enough siblings

12 29
Demote root key and
promote leaf key

7 9 15 22 31 43 56 69

Delete 22

Note when printed: this slide is animated

Type #3: Enough siblings

12 31

7 9 15 29 43 56 69

Note when printed: this slide is animated

 Exercise in Removal from a B-Tree
• Given 5-way B-tree created by these data (last
exercise):
• 3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 8, 19, 4,
31, 35, 56

• Add these further keys: 2, 6,12

• Delete these keys: 4, 5, 7, 3, 14

Answer to Exercise

Java Applet Source