 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
For
example...
|
|
|
|
– |
Can
you make a copy of a linear linked list?
|
|
|
|
– |
What
about deallocating all nodes in a circular
|
|
linked
list
|
|
|
|
– |
Can
you find the largest data item that resides
|
|
|
within
a sorted linked list? How about an
|
|
|
unsorted
linked list?
|
|
|
|
– |
Could
you do the same thing with an array of
|
|
|
linked
lists (unsorted, of course)
|
|