In Summary
Therefore, to traverse a table and print out
items in sorted order would require you to
sort the table first.
As we will learn, binary search trees can be
far more effective for letting you do both
searching and traversal - IN SORTED
ORDER than hash tables.