In Chapter 3, Arrays, you learned about the array data structure. An array (we can also call it a list) is a very simple data structure that stores a sequence of data. In this chapter, you will learn how to implement and use a linked list, which is a dynamic data structure, meaning that we can add or remove items from it at will and it will grow as required.
In this chapter, we will cover the following topics:
- The linked list data structure
- Adding elements to a linked list
- Removing elements from a linked list
- How to use the LinkedList class
- Doubly linked lists
- Circular linked lists
- Sorted linked list
- Implementing a stack with linked lists
