第3节链表的操作.PPT

头插形成双向链表 void AddNode(Node **listpointer, Node ** tailpointer, char a) { Node *temp; temp = ( Node *)malloc(sizeof(Node)); temp--key = a; temp--next =* listpointer; temp--previous=NULL; if(*listpointer != NULL) (*listpointer-)-previous=temp; * listpointer = temp; if(*tailpointer==NULL) tailpointer = temp;//若插入第1个节点} 验证…… int main() { Node *LL = NULL; Node *Tail_LL = NULL; Add Node(LL, Tail_LL, A); Add Node(LL, Tail_LL, B); Add Node(LL, Tail_LL, C); } 双向链表的操作 头插法形成链表 尾插法形成链表 正向输出链表 反向输出链表 尾插法形成双向链表 void Add Node_Tail(Node ** listpointer, Node ** tailpointer, char a) { Node *