单链表增删改查（Single linked list additions and deletions to change）.docVIP

下载本文档

4
0
约4.27千字
约 12页
2017-09-07 发布于河南
举报
版权申诉

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

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

单链表增删改查（Single linked list additions and deletions to change）

单链表增删改查（Single linked list additions and deletions to change） The structure of a single linked list data structure is the most simple, each node it is only one of a node to a pointer. Create a single list: Typedef struct node { Int data; / / node content Node *next; / / the next node }node; / / create a single list Node (*create) { Int i=0; / / the number of data in the list Node *head, *p, *q; Int x = 0; Head = (node * malloc) (sizeof (node)); / / create a head node While (1) { Printf (Please input the data:); Scanf (%d, x); If (0 = = x) //data for the creation of the end of 0 { Break; } P = (node * malloc) (sizeof (node)); P-data = x; If (++i = = 1) / / list of only one element { Head-next = p; / / head is connected to the back } Else { Q-next = p; / / connected to the end of the list } Q = p; //q points to the last node } Q-next = NULL; / / the last pointer list for NULL Return head; } In the code above, the while cycle each time an integer data read from the terminal, and call malloc dynamic allocation list node memory the integer data, then in the end is inserted into the single list; finally when the data of 0 represents the insertion end of data the end node, next pointer to NULL. / / single chain length measurement Int length (node *head) { Int len = 0; Node *p = head-next; While (NULL! = P) { Len++; P = p-next; } Return len; } / / print list Void print (node *head) { Int POS = 0; Node *p = NULL; If (NULL = head-next) { Printf (Link is empty \n!); Return; } P = head-next; While (NULL! = P) / / traversing the list { Printf (The%dth node is:%d\n, ++pos, p-data); P = p-next; } } / / single list node search / / node search POS position, returns the node pointer //pos from the beginning of 0, 0 or head nodes Node *search_node (node *head, int POS) { Node *p = head-next; If (POS 0) //pos position is not correct { Printf (incorrect position to search node \n!); Return NULL; } If (POS = 0) { Return head; } If (NULL = P) { Printf (Link is empty \n!); / / list is emp