This document discusses linked lists, which are data structures that store elements in separate blocks of memory rather than in a continuous block. Each element contains data as well as a pointer to the next element, allowing elements to be scattered throughout memory and accessed sequentially through the pointers.

1. Linked
List

2. ntial
continuous
block
of
memory
om
access
based
on
memory
ress
=
first_address
+
(element_
Size
memory
adjacent
to
the
bloc