Chapter 25
Linked Lists
So far in this book we have been very happy to use the collections libraries without having a full understanding of how they work. That is fine for much of what we have done and in a first year of Computer Science (CS) study, but real developers need to have knowledge of what is really happening so that they can make informed opinions about what collection types to use in different situations. This chapter will begin to reveal how we can build our own structures for storing data by linking objects that store small pieces of data together.
25.1 The List/Seq ADT
The topic of this chapter is the linked list. This is an approach to storing data in a way that can be applied to some different Abstract Data Types (ADTs). Later ...
Get Introduction to the Art of Programming Using Scala now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
