Dynamic Linked Lists
•
For example, a list with a single character
data member (one byte)
–
may require a 4-byte pointer as its link
–
resulting in 80% overhead (4 bytes out of 5) in each list
node
•
Lastly, allocating and deallocating memory at run-
time is overhead and can overshadow the time
saved by simple list-processing algorithms.
•
** no hard and fast rules! **
