資料結構›Ch4 鏈結串列第 8 題/共 22 題
8. Circular Doubly-Linked List、刪除操作
#DS-04-008易Circular Doubly-Linked List刪除操作
Given a reference that points to a node in a doubly circular linked list. Please write a pseudocode function to delete the node from the doubly circular linked list. No return values are expected. Note: A node in a doubly circular linked list has two pointers, named 'next' and 'prev', respectively, where the 'next' pointer is used to find the next node and the 'prev' pointer is used to find the previous one.
📄 台大110
▤完整推導請見《WH 資工筆記 · 資料結構》Ch4 鏈結串列