| Circular Linked Lists |
|
|
|
|
|
|
|
|
|
|
| • | Can
we avoid having a previous pointer in |
||||||||
| our
traversals with a circular linked list? |
|||||||||
| No!
(unless a look ahead is used) |
|||||||||
| • | Count
the number of operations/fetches |
||||||||
| and
compare with the other approaches |
|||||||||
| for
today |
|||||||||
| • | What
about deallocating all nodes? How |
||||||||
| does
that work? |
|||||||||