You are viewing a single comment's thread. Return to all comments →
C++
DoublyLinkedListNode* searchNode; DoublyLinkedListNode* insertNode = new DoublyLinkedListNode(data); searchNode = llist;
if (llist == nullptr) { return insertNode; }
if (data < searchNode->data) { searchNode->prev = insertNode; insertNode->next = searchNode; return insertNode; }
while (searchNode != nullptr) { if (searchNode->data > data) { searchNode->prev->next = insertNode; insertNode->next = searchNode; return llist; }
if (searchNode->next == nullptr) { searchNode->next = insertNode; insertNode->prev = searchNode; return llist; } searchNode = searchNode->next;
}
return llist;
Seems like cookies are disabled on this browser, please enable them to open this website
Inserting a Node Into a Sorted Doubly Linked List
You are viewing a single comment's thread. Return to all comments →
C++
DoublyLinkedListNode* searchNode; DoublyLinkedListNode* insertNode = new DoublyLinkedListNode(data); searchNode = llist;
if (llist == nullptr) { return insertNode; }
if (data < searchNode->data) { searchNode->prev = insertNode; insertNode->next = searchNode; return insertNode; }
while (searchNode != nullptr) { if (searchNode->data > data) { searchNode->prev->next = insertNode; insertNode->next = searchNode; return llist; }
}
return llist;