数据结构——双链表

 1 void CreateDlistR(DLNode *&L,int a[],int n){
 2     DLNode *s,*r;
 3     int i;
 4     L = (DLNode *)malloc(sizeof(DLNode));
 5     L -> prior = NULL;
 6     L -> next = NULL;                        //空的双向链表
 7     r = L;                                    //r指向L的头结点也是尾结点
 8     for(i = 0;i < n;i++){
 9         s = (DLNode *)malloc(sizeof(DLNode))    
10         s -> data = a[i];
11         r -> next = s;
12         s -> peror = r;                        //双链表的相互连接操作
13         r = s;
14     }
15     r -> next =NULL;
16 }

1 DLNode* findNode(DLNode *C,int x){
2     DLNode *p = C -> next;
3     while(p!=NULL){
4         if(p -> data == x)
5             break;
6         p = p ->next;                //没查找一次向右移一次
7     }
8     return p;
9 }

1 s -> next = p -> next;
2 s -> peror = p;
3 p -> next = s;
4 s -> next -> prior = s;

1 q = p -> next;
2 p -> next = q -> next;        //相当于p -> next = p -> next -> next
3 q -> next -> peror = p;
4 free(q);循环链表的特点：

p -> next == head