Data Structures
•If the size varies
greatly, or cannot be allocated contiguously,
or is unknown
–use a linear linked
list with little additional costs in run-time
performance
–does, however, add the
memory cost of one additional address per
node which should not be forgotten
–what happens if we
implemented the traversal algorithms using
recursion?