Treffer: Linked Lists.

Linked lists allow us to structure input data sets into elementary units by chopping the data-sets into its many individual elements that are stored in corresponding cells. Cells are all chained together into a single thread of cells, starting from the head to the tail. These chained cells can be manipulated dynamically by either adding or removing elements. These operations can be carried out efficiently (in constant time O(1)) by creating new cells or deleting some cells of the list. Linked lists are therefore preferred to arrays whenever we do not know a priori the input size. This is all the more interesting for sorting and searching operations that consider dynamic data sets in practice. [ABSTRACT FROM AUTHOR]

Copyright of Concise & Practical Introduction to Programming Algorithms in Java is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)