In this chapter, you learned about the linked list data structure and its variants: the doubly linked list, the circular linked list, and the sorted linked list. You learned how to add and remove elements at any position, and how to iterate through a linked list. You also learned that the most important advantage of a linked list over an array is that you can easily add and remove elements from a linked list without shifting over its elements. So, whenever you need to add and remove lots of elements, the best option will be a linked list instead of an array.
You also learned how to create a stack using an internal linked list to store its elements instead of an array or an object, and you also learned the benefits of using another data structure to leverage its available operations instead of writing all the logic from scratch.
In the next chapter, you will learn about sets, a data structure that stores unique elements.