Consider a data structure of trees that have leaves with numbers in them, and two kinds of interior nodes: one kind with two sons and the other kind with three sons. Here's an example:
These trees are similar, but not identical to what are usually called 2-3 trees.
[ANSWER](Remember, you won't get anything about of this exercise unless you actually write the code and test it.)
Last modified: Fri Sep 4 11:44:05 Eastern Daylight Time 2015