1、#include <stdio.h>#include <stdlib.h>typedef struct nodeint value;struct node *next;NODE, *PNODE;void InsertHead(PNODE *ppHead, int val)PNODE pNewNode = (PNODE)malloc(sizeof(NODE);pNewNode->value = val;pNewNode->next = *ppHead;*ppHead = pNewNode;void ShowList(PNODE pHead)PNODE p =

2、pHead;while (p != NULL)printf("%d,", p->value);p = p->next;printf("b n");void ClearList(PNODE *ppHead)PNODE p = NULL;while (*ppHead != NULL)p = *ppHead;*ppHead = (*ppHead)->next;free(p);void InsertTail(PNODE *ppHead, int val)PNODE pNewNode = (PNODE)malloc(sizeof(NODE);pN

3、ewNode->value = val;if (NULL = *ppHead)InsertHead(ppHead, val);elsePNODE p = *ppHead;while (p->next != NULL)p = p->next;p->next = pNewNode;pNewNode->next = NULL;void DeleteHead(PNODE *ppHead)PNODE p = NULL;if (*ppHead != NULL)p = *ppHead;*ppHead = p->next;free(*ppHead);void DeleteT

4、ail(PNODE *ppHead)if (*ppHead != NULL)if (NULL = (*ppHead)->next)free(*ppHead);*ppHead = NULL;elsePNODE p = *ppHead;while (p->next->next != NULL)p = p->next;free(p->next);p->next = NULL;PNODE RemoveNode(PNODE *ppHead)PNODE p = NULL;if (*ppHead != NULL)p = *ppHead;*ppHead = p->ne

5、xt;p->next = NULL;return p;void ReverseList(PNODE *ppHead)PNODE pNewHead = NULL;while (*ppHead != NULL)PNODE p = RemoveNode(ppHead);p->next = pNewHead;pNewHead = p;*ppHead = pNewHead;void SortList(PNODE *ppHead)PNODE pGet = NULL;PNODE pNewHead = NULL;while (pGet = RemoveNode(ppHead) != NULL)if

6、 (NULL = pNewHead)pNewHead = pGet;pGet->next = NULL;elsePNODE p = pNewHead;while (p != NULL) && (p->value < pGet->value)p = p->next;if (p = pNewHead)pGet->next = pNewHead;pNewHead = pGet;elsePNODE s = pNewHead;while (s->next != p)s = s->next;s->next = pGet;pGet->

7、;next = p;*ppHead = pNewHead;int main(void)PNODE pHead = NULL;ClearList(&pHead);/DeleteTail(&pHead);/InsertHead(&pHead, 1);/InsertHead(&pHead, 2);/InsertHead(&pHead, 3);/InsertHead(&pHead, 4);/InsertHead(&pHead, 5);InsertTail(&pHead, 1);/DeleteHead(&pHead);/DeleteTail(&pHead);InsertTail(&pHead, 2);InsertTail(&pHead, -3);InsertTail(&pHead, -4);Inse