CScD-320, Algorithms
Homework 7: B-Tree Operations
Due at the beginning of the review session on Monday, 11 May
Solution Set
Starting with the following B-tree of order 5, perform the indicated operations and
show the result after each operation, and be sure to redraw the tree after a node
split. When a node overflows, split it immediately. Do not use the method of
giving a child to a neighbor node.
42 53 75
10 24 25 27
44 46 52 54 55 68 73
78 92
24 42 53 75
44 46 52
54 55 68 73
78 92
25 27
10 13
Insert 13
76 77 78 92
25 27
10 13
53
24 42 62 75
54 55
68 73
Insert 50, 76, 62, 77
44 46 50 52
Printed 02 December 2020 10:32 Page 1 OVER
