Doubly Linked Lists
•Let’s do one more. Add at the end of a doubly linked list without a tail ptr:
•What is wrong with this code:
–node * current = head;
–while (current)
– current= current->next;
–current->next = new node;
–current->next->prev = current
–current->next->next = NULL;
–