数据结构 双向链表存储

#include "Header_SqList.h" #include <stdlib.h> #include <iostream.h> #ifndef iostream_h #endif iostram_h void Init_SqList(LinkList &A) { A=(LinkList)malloc(sizeof(Node)); if(!A) exit(0); else A->next=NULL; } void Ins_SqList(LinkList &A,int pos,int e) { if (pos<=0) exit(0); LinkList p=A; for (int i=0;(i<pos)&&p->next;i++) { p=p->next; } LinkList Newbase=(LinkList)malloc(sizeof(Node)); Newbase->data=e; if (i!=pos) { Newbase->prior=p; p->next=Newbase; Newbase->next=NULL; } else { Newbase->next=p->next; p->next->prior=Newbase; p->next=Newbase; Newbase->prior=p; } } int Get_SqList(LinkList &A,int pos) { if (pos<=0) exit(0); LinkList p=A; for (int i=0;i<pos;i++) { p=p->next; } return (p->data); } int GetLength_SqList(LinkList A) { for (int i=0;A->next;i++) { A=A->next; } return i; }