Doubly linked List 03 Delete Node
Node* RemoveNode(Node* node){ Node* prevNode = node->prev; Node* nextNode = node->next; prevNode->next = nextNode; nextNode->prev = prevNode; delete node; return nextNode;}void InsertNode(Node* posNode, int data){ Node* node = new Node(data); Node* prevNode = posNode->prev; prevNode->next = node; node->prev = prevNode; node->next = posNode; posNode->prev = node;}
자료구조&알고리즘/C++
2024. 12. 11. 10:48
