The next group of data structures, described in the first chapter, is related to lists. They are similar to arrays, but make it possible to dynamically increase the size of the collection if necessary. In the following diagram, you can see a few variants of a list, namely single-linked, double-linked, and circular-linked, respectively:
It is worth mentioning that the built-in implementation is available for the array list (ArrayList), as well as its generic (List) and sorted (SortedList) variants. The latter can be understood as a collection of key-value pairs, always sorted by keys.
A short comment may be beneficial for a single-linked, ...
