Data Structures
Relative lists: (linear linked lists)
no holes -- so no extra position needed in each
node
insert, retrieve, remove requires traversal
a tail pointer assists if appending at the end
no shifting!!
So, while we still have to search, and the search may be more expensive than with an array -- this is greatly improved for a relative list, since there is not shifting!!