双链表增删改查（Double linked list CRUD）.docVIP

双链表增删改查（Double linked list CRUD） Two way linked list is actually an improvement of single linked list. When it is used to operate a single linked list, sometimes it is necessary to operate the direct predecessor of a node, and it must start with the header. Because a single list of each node has only one successor node direct memory address of the training domain, so the use of a single list cannot do, so it leads to not only a direct successor node address of the storage and storage practice domain, direct predecessor node address training domain to struct node. (1) establish a two-way linked list Typedef struct DbNode { Int data; / / node data DbNode *left; / / pointer precursor node DbNode *right; / / pointer successor node }DbNode; Create a doubly linked list (for convenience), as defined here are 3 functions) as follows: CreateNode () creates a node based on the data to return the newly created node. The CreateList () function creates the list header of a linked data and returns the header node. The AppendNode () function always inserts a new node at the end of the table (its internal strip is generated with CreateNode () nodes and returns the header node. According to the data / / create a node DbNode *CreateNode (int data) { DbNode *pNode = (DbNode *) malloc (sizeof (DbNode)); PNode-data = data; PNode-left = NULL; / / create a new node, PNode-right = NULL; / / make precursor and successor pointers are NULL Return pNode; } / / create list DbNode *CreateList (int head) / / parameter header node data {/ / header node as a meaningful data storage node DbNode *pNode = (DbNode *) malloc (sizeof (DbNode)); PNode-data = head; PNode-left = NULL; PNode-right = NULL; Return pNode; } / / always insert a new node at the end of the table, return the header node DbNode *AppendNode (DbNode, *head, int, data) { DbNode *node = CreateNode (data); DbNode *p = head; DbNode *q = NULL; While (NULL = = P) { Q = p; P = p-right; } Q-right = node; Node-left = q; Return head; } You can