•And,
don’t forget that in some cases dynamic
linked lists can waste memory.
It is possible to store many pointers
compared to the quantity of
data. This pointer space must be considered
as overhead, which is accentuated
when the nodes contain
a small amount of data (like a
LLL of single characters!)
