c++链表（C++ list）.docVIP

c++链表（C++ list） [doubly linked list] Set up a two-way linked list 1 typedef struct DbNode 2 { 3 int data; / / node data 4 DbNode *left; / / pointer precursor node 5 DbNode *right; / / pointer successor node 6} DbNode; (1) building a two-way linked list: for convenience, three functions are defined here: Q CreateNode () creates a node based on data to return the newly created node. The Q CreateList () function creates the list header of a linked data and returns the header node. The Q AppendNode () function always inserts a new node at the end of the table (its internal call CreateNode () generates the node) and returns the header node. 1 / / create a node according to data 2 DbNode *CreateNode (int data) 3 { 4, DbNode, *pnode = (DbNode *) malloc (sizeof (DbNode)); 5 pnode-data = data; 6 pnode-left = pnode-right = pnode; / / create a new node 7 / / let the previous and subsequent pointer points to itself 8 return pnode; 9} Ten 11 / / create list 12 DbNode *CreateList (int head) / / parameter header node data 13 {/ / header node not as storage node data significance 14, DbNode, *pnode = (DbNode *) malloc (sizeof (DbNode)); 15 pnode-data = head; 16 pnode-left = pnode-right = pnode; Seventeen 18 return pnode; 19} Twenty 21 / / insert a new node, always insert at the end of the table back to the header node; 22 DbNode *AppendNode (DbNode *head, int data) / / 1 is the header node parameter list, 23 {/ / parameter 2 is to insert the node, the data is data 24 DbNode *node = CreateNode (data); / / create data for the new node data 25, DbNode, *p = head, *q; Twenty-six 27 while (P = = NULL) 28 { 29 q = p; 30 P = p-right; 31} 32 q-right = node; 33 node-left = q; Thirty-four 35 return head; 36} We can use the CreateList () and AppendNode () to generate a list, followed by a data generation from 0 to 9, with a circular list of 10 nodes. 1 DbNode *head = CreateList (0); / / header header data for the 0 generation. Two 3 for (int, I = 1; I 10; i++) 4 { 5 head = AppendNode (head,