C++版本的单链表的操作.docxVIP

#include iostreamusingnamespace std;//链表结点struct LinkNode{int val;LinkNode* next;LinkNode():next(NULL){}};//创建链表结点LinkNode*CreateLinkNode(int value){LinkNode* newNode =new LinkNode();if (newNode == NULL){return NULL;}newNode-val = value;newNode-next = NULL;return newNode;}//判断链表是否为空boolIsEmpty(LinkNode* list){return list-next == NULL;}//判断是否是最后一个结点boolIsLast(LinkNode* position){return position-next == NULL;}//在尾部插入结点voidInsertTailNode(LinkNode* list, LinkNode* newNode){if(list == NULL){list = newNode;}else{LinkNode* tmpNode = list;while(tmpNode-next != NULL){tmpNode = tmpNode-next;}tmpNode-nex