数据结构c语言版第二章课件严蔚敏.pptVIP

2. 双向链表(Double Linked List) 类型描述 typedef struct DuLNode{ ElemType data; struct DuLNode *prior; struct DuLNode *next; }DuLNode, *DuLinkList; 双向循环链表 p-next-prior = p-prior-next; p 双向链表的前(后)插入操作 ①s-prior = p-prior; ②p-prior-next = s;  ③ s-next = p; ④p-prior = s; q ①s-next = q-next; ②q-next-prior= s;  ③s-prior = q; ④q-next = s; ③ ④ ② ① 双向链表的删除操作 ①p-prior-next = p-next; ②p-next-prior = p-prior; 删除*p的直接后继结点的语句序列 q = p-next; p-next = p-next-next; p-next-prior = p; free(q); 删除*p的直接前驱结点的语句序列 q = p-prior;