This chapter introduced you to data structures and the concepts of
Arrays
Linked lists
Stacks
Queues
Hash tables
Trees
It made comparisons of the performance trade-offs of each with respect to adding items, removing items, searching for items, and displaying the contents of the data structure.
Next, it introduced additional collection class concepts:
Lists
Sets
Maps
Iterators
Finally, the chapter walked you through the Java collection class implementations including an overview of the top methods in each class and an example.
Managing data is a vital part of any computer program, and the Java collection classes provide you with the ability to do this. The next chapter moves to another vital part of computer programming: input and output, or retrieving data and sending data.
