C++双向轮回链表代码(建立、排序、拔出、删除)(国外英文资料).docVIP

C++双向循环链表代码(建立、排序、插入、删除)(国外英文资料) / * Write a complete program to implement the basic operation of a two-way loop linked list (1) a bi-directional circular list is established using the method of tail-interpolation. (2) iterating through the bi-directional loop list. (3) to remove a specified element in the two-way loop linked list. (4) the insertion element e is still an orderly algorithm in the non-decreasing order two-way loop linked list. (5) to determine whether the element in a bi-directional circular chain is symmetric if it returns 1, otherwise it returns 0. (6) set the element to be positive integer, and the implementation algorithm will arrange all the odd Numbers before even. (7) design a simple menu to debug the above algorithm in the main function. * / # include stdio, h # include stdlib. H Typedef int elemtype; Typedef struct DuLNode / / define node type { Elemtype data; The prior struct DuLNode *; Struct DuLNode * next; } DuLNode, * Dulinklist; Int initlist (Dulinklist L) / / initialize a two-way list { (Dulinklist). / / header attachment If (! L) exit (-2); L - data = 0; L - next = L; L - the prior = L; Return 1; } / / initialize an empty table Void createlist (Dulinklist l) / / caudal method generates a bi-directional list { Dulinklist p, t; T = L; Printf ( in the tail method: enter a two-way list node value to end with input 0. \ n ); Scanf ( % d , t- data); While (t - data! = 0) { (Dulinklist) malloc (DuLNode); If (! P) exit (-2); T - next = p; P - the prior = t; Scanf ( % d , p - data); T = p; } So L minus prior = t minus prior; The t- prior- next = L; } Void shuchulist Dulinklist (L) / / the information in the linked list through the chain table { Int I; Dulinklist p; Printf ( bi-directional linked list is: ); For (p = L, I = 1; p- next! = L; p = p- next) { Printf ( % d , p- data); I++; } Printf ( % d \ n , p- data); Printf ( the length of the bi-directional chain is % d \ n \ n , I); } Dulinklist GetElem (Dulinklist L, int x) / /