•On the other hand, 2-3-4 trees require
more storage
than a binary search tree
–and more storage (and less
efficiently used storage) than a 2-3 tree
•But, a binary search tree may be inappropriate
–because it may not be balanced
–so we use a red-black tree which is a
special binary search tree
