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 k 1, k 2, k 3, or k 4 do we store...

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?

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.