| Dummy Head Nodes |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Variations
to singly linked lists have been |
|||||||||||
| designed
to decrease the complexity and |
||||||||||||
| increase
the efficiency of specific algorithms |
||||||||||||
| • | For
many list processing algs, the first node |
|||||||||||
| of
the list is a special case |
||||||||||||
| – | we’ve
seen this with inserting and deleting |
|||||||||||
| – | because
updating the head pointer is different |
|||||||||||
| from
updating a next pointer of another node |
||||||||||||