Data Structures
•What about a linked list of arrays
–where every n items
are stored in the first node, the next n items
are stored in the second node, etc.
–This still requires
traversal to get to the right node, but then
from there direct access can be used to insert, retrieve, remove the data
–May be the best of
both worlds for relative lists, limiting the
amount of shifting to “n” items while at the
same time keeping the traversal to a manageable level
•