Discuss 2-3 Trees
Allowing nodes to have more than 3
children would require more comparisons
and would therefore be counter productive
unless you are working with external storage
and each node requires a disk access, then we
use b-trees which have the minimum height
possible