Problem
1. 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.
2. Draw four different red-black trees that correspond to the same (2,4) tree.