@DanielFischer I am looking at the following exercise:
Assume that at the nodes of a 2-3 tree, the following keys are saved (in an increasing order): $3,6,9,15,18,21,24, 27, 30, 33, 36$.
It is also given that the root is a 2-node that contains the number $12$.
Draw the tree.
PS: It is not required to make so many insertions as the above keys in an initially empty 2-3 tree. It is just required to draw only one tree that is a 2-3 tree and that contains the above keys at its nodes(which you have to decide if they should be 2-nodes or 3-nodes).