双链表增删改查（Double linked list additions and deletions to change）.doc

下载文档 降价啦

1
0
约4.59千字
约 11页
2017-08-30 发布于河南
举报
版权申诉
保障服务

双链表增删改查（Double linked list additions and deletions to change）.doc

1、本文档共11页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

双链表增删改查（Double linked list additions and deletions to change）

双链表增删改查（Double linked list additions and deletions to change） 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