Updating...doubly LLL
•But, this is not all...we have to update the previous pointer in the “next” node too:
–if (current->next)
–  current->next->prev =current->prev;
–
–anything else? (draw a picture)
–why did we have to check if current->next?