数据结构用C语言描述第二章.pptVIP

计算双向循环链表的长度 int Length ( dlinklist *head ) { //计算带表头结点的双向循环链表的长度 dlinklist * p = head-next; int count = 0; while ( p != head ) { p = p-next; count++; } return count; } 双向循环链表的插入 (非空表) q-prior = p; q-next = p-next; p-next = q; q-next-prior = q; 在结点 *p 后插入25 head head 31 48 15 p p 31 48 25 15 q 双向循环链表的插入 (空表) q-prior = p; q-next = p-next; p-next = q; q-next-prior = q; p q head 25 head p 在结点 *p 后插入25 int Insert ( dlinklist * head, int i, datatype x ) { dlinklist *p,*q; p = GET ( head, i-1 ); //指针定位于插入位置 if ( p == head i != 1) return 0;