Doubly Linked Lists
	• We can still go “too far” with a doubly LL node * current = head; if (!current) //insert at the head else while (current->next)    current= current->next; current->next = new node; current->next->prev = current; current->next->next = NULL; – Any better approaches? Anything missing?