3. (10 points): Illustrate the inserting e process of inserting an initial empty 2-3-4 tree with the sequence of keys: 5, 16, 22, 45,2, 10, 18, 30, 50, 12, 1. Show transcribed image text 3. (10 points): Illustrate the inserting e process of inserting an initial empty 2-3-4 tree with the sequence of keys: 5, 16, 22, 45,2, 10, 18, 30, 50, 12, 1.
Answer
2-3-4 tree is B-trees of order 4.
keys to insert5,16,22,45,2,10,18,30,50,12,1.
1. Insert 5
2.
OR
OR