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

#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-next = newNode;//最后一个的下一个结点指向新结点}}//在链表中找到一个结点LinkNode*Find(int value, LinkNode* list){if (list == NULL){return NULL;}LinkNode* tmpNode = list-next;while(tmpNode!= NULL tmpNode-val != value){tmpNode = tmpNode-next;}return tmpNode;}//找到某一元素的前驱结点LinkNode*FindPrevious( int value, LinkNode* list){if (list == NULL){return;}LinkNode* tmpNode = list;while(tmpNode-next != NULL tmpNode-next-val != value){tmpNode = tmpNode-next;}return tmpNode;}//删除某个结点voidLinkNode(int value, LinkNode* list){if(list == NULL){return;}LinkNode* ToBeDelete = NULL;LinkNode* tmpNode = list;while(tmpNode-next != NULL tmpNode-next-val != value){tmpNode = tmpNode-next;}if(tmpNode-next != NULL){ToBeDelete = tmpNode-next;tmpNode-next = ToBeDelete-next;delete ToBeDelete;ToBeDelete = NULL;}return;}//将一个元素插入到知识的结点之后，元素的值为ValuevoidInsertNode(int value, LinkNode* list, LinkNode* pToBeInsertNode){if(list == NULL || pToBeInsertNode == NULL){return;}LinkNode* pNewNode = newListNode();if(pNewNode == NULL){return;}pNewNode-val = value;pNewNode-next = pToBeInsertNode-next;pToBeInsertNode-next = pNewNode;}//删除整个链表voidDelete(LinkNode* list){if(list == NULL){return;}LinkNode* pNode = list-next;LinkNode* tmpNode = NULL;while(pNode != NULL){tmpNode = pNode-next;delete pNode;pNode =tmpNode;}}//逆序打印链表voidprintListReversingly(LinkNode* list){stackLinkNode* nodes;LinkNode* tmpNode = list-next;while(tmpNode != NULL){nodes.push(tmpNode