Summary
In this chapter, we have looked at linked lists. We have studied the concepts that underlie lists, such as nodes and pointers to other nodes. We implemented the major operations that occur on these types of list and saw how their worst case running times compare.
In the next chapter, we are going to look at two other data structures that are usually implemented using lists: stacks and queues.