2-3-4 Homework, Due Wednesday, 10/9

Create the 2-3-4 trees that result from the following input data. It is NOT necessary to redraw the tree after every insert. It IS necessary to draw the tree as it is immediately before and after each promotion. For example, if doing this for the input 1, 2, 3, 4, then you would draw a tree once (1,2,3) has been added, and then the tree after promoting the 2 and adding the 4. I have to be able to follow your work, or I cannot give you points.

  1. 9, 10, 4, 3, 6, 2, 7, 1, 8, 5
  2. 7, 8, 10, 4, 5, 12, 2, 9, 6, 1, 3, 11
  3. 1, 3, 11, 14, 8, 9, 12, 13, 5, 7, 4, 10, 6, 15, 2