| Traversing...singly LLL |
|
|
|
|
|
|
|
|
|
|
|
| • | With
the look ahead approach: |
|||||||||
| node *
current=head; |
||||||||||
| if (current) |
||||||||||
| while (current->next && |
||||||||||
| current->next->data != match) { |
||||||||||
| current = current->next; } |
||||||||||
| • | Count
the number of operations, fetches... |
|||||||||
| • | Compare
these two techniques |
|||||||||