 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
The
result is that many of our algorithms have the
|
|
form:
|
|
|
|
– |
if
the node is the first node being processed
|
|
|
|
• |
update
the head appropriately
|
|
|
|
– |
otherwise
|
|
|
|
• |
process
the node normally
|
|
|
| • |
One
way to eliminate this special case is to
|
|
|
include
a head node or list header (dummy head
|
|
|
node)
|
|