代碼如下``

#include<stdio.h> #include<stdlib.h>typedef int DataType; struct Node {DataType data;struct Node* next; }; typedef struct Node *PNode; typedef struct Node *LinkList;LinkList SetNullList_Link() {LinkList head = (LinkList)malloc(sizeof(struct Node));if (head != NULL) head->next = NULL;else printf("alloc failure");return head; }void CreateList_Tail(struct Node* head) {PNode p = NULL; PNode q = head; int data;scanf("%d", &data);while (data != -1) { p = (struct Node*)malloc(sizeof(struct Node));p->data = data;p->next = NULL;q->next=p;q=p;scanf("%d", &data);} } void print(LinkList head) {PNode p = head->next;while (p) {printf("%d ", p->data);p=p->next;} } void DestoryList_Link(LinkList head) {PNode pre = head; PNode p = pre->next;while (p) {free(pre);pre = p;p = pre->next;}free(pre); }int main() {LinkList head = NULL;head = SetNullList_Link();CreateList_Tail(head);print(head);DestoryList_Link(head);return 0; }

總結(jié)

以上是生活随笔為你收集整理的采用尾插法建立单链表并输出链表的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。