Traversing...singly LLL
•Let’s examine this further:
–node * current=head;
–node * previous= NULL;
–while (current && current->data != match) {
– previous = current;
– current = current->next; }
•Count the number of operations, fetches...