2-3 Trees
•Instead, we find the smallest (38), middle (39) and largest (40) data items at this node.
•You can move the middle value (39) up to the node's parent and separate the remaining values (38,40) into two nodes attached to the parent.
•Notice that since we moved the middle value to the parent -- we have correctly separated the values of its children. See the results: