Traversing...doubly LLL
	• But, with a doubly linked list, we have: node * current=head;  while (current &&        current->data != match) {    current = current->next;    } • Count the number of operations, fetches... • Compare this with the last two techniques