Delete and free the node pointed by tail in a double linked list. [C] Solution /

Question

Delete and free the node pointed by tail in a double linked list. [C]

Explanation / Answer

// Locate the item to remove Node* to_remove = head; while(to_remove && to_remove->data != item) to_remove = to_remove->next; // Do the removal if we found it if(to_remove) { // If it was at the head, advance the head to the next item if(to_remove == head) head = head->next; // If it was at the tail, advance the tail to the previous item if(to_remove == tail) tail = tail->previous; // Remove from the list if(to_remove->next) to_remove->next->previous = to_remove->previous; if(to_remove->previous) to_remove->previous->next = to_remove->next; // Free the removed node delete to_remove; count--; return true; } return false;

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.