+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. An alternative way of performing a split at a node w in a (2,4) tree is to partition w into…

1. An alternative way of performing a split at a node w in a (2,4) tree is to partition w into…

1. An alternative way of performing a split at a node w in a (2,4) tree is to partition w into w′ and w′′, with w′ being a 2-node and w′′ a 3-node. Which of the keys k1, k2, k3, or k4 do we store at w’s parent? Why?2. Dr. Amongus claims that a (2,4) tree storing a set of entries will always have the same structure, regardless of the order in which the entries are inserted. Show that he is wrong.