Question: Insert the following items into an empty B-tree where every node must have between 1 and 3 keys in it (so internal nodes have a
Insert the following items into an empty B-tree where every node must have between 1 and 3 keys in it (so internal nodes have a minimum of 2 children and a maximum of 4 children): 12; 10; 20; 9; 13; 18; 4; 2; 1; 15; 19; 21; 5; 8; 14; 17; 7; 11; 16; 6; 3.
Draw the tree after the inserts of 18, 8, 3.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
