Data Structures in Practice

A linked list stores each element in a node that points to the next. Inserting at the head takes constant time, but finding the k-th element requires walking k nodes.

Implementing the list as a generic class LinkedList<T> lets the same code store integers, strings or custom objects safely.

Compare with arrays: contiguous storage gives fast indexing but costly insertion in the middle.