双链表

1.采用尾插法建立双链表

void CreateDlistR(DLNode *&L,inta[],int n)
{
  DLNode *s,*r;
  int i; 
  L=(DLNode*)malloc(sizeof(DLNode));
  L->next=NULL;
  r=L;
  for(i=1;i<=n;++i)  
  {s=(DLNode*)malloc(sizeof(DLNode));
  s->data=a[i];
  r->next=s;
  s->prior=r;
  r=s;
  }
r->next=NULL;

}

2.查找结点的算法

DLNode  * searchNode(DLNode *C ,int x)
{  DLNode *p=C->next;
 while(p!=NULL)
 {
   if(p->data==x)
   break;
   p=p->next; 
 }
 return p;